The Generalized Road Coloring Problem and periodic digraphs
classification
🧮 math.CO
math.PR
keywords
periodicdigraphsalgebraiccoloringconnectedcontextgeneralizedproblem
read the original abstract
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.