Cycles of relatively prime length and the road coloring problem

DOI10.1007/BF02784133zbMath0979.05046OpenAlexW2067312148MaRDI QIDQ5939288

No author found.

Publication date: 17 February 2002

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02784133

zbMATH Keywords

cyclepathroad coloring problemsynchronizing coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

A vector space approach to the road coloring problem ⋮ An algorithm for road coloring ⋮ Synchronizing finite automata on Eulerian digraphs. ⋮ A quadratic algorithm for road coloring ⋮ A note on the rank of semigroups. ⋮ The road coloring problem ⋮ Černý's conjecture and the road colouring problem

Cites Work

• Unnamed Item
• Unnamed Item
• The road-colouring problem
• Equivalence of topological Markov shifts
• On the Road Coloring Problem
• Codes asynchrones
• Similarity of automorphisms of the torus