The road-colouring problem

DOI10.1007/BF02762860zbMath0471.05033WikidataQ55982183 ScholiaQ55982183MaRDI QIDQ1157339

George L. O'Brien

Publication date: 1981

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

zbMATH Keywords

strongly-connected directed graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

A vector space approach to the road coloring problem ⋮ The Synchronization Problem for Locally Strongly Transitive Automata ⋮ An algorithm for road coloring ⋮ Synchronizing finite automata on Eulerian digraphs. ⋮ The road problem and homomorphisms of directed graphs ⋮ A quadratic algorithm for road coloring ⋮ On the Road Coloring Problem ⋮ A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM ⋮ Cycles of relatively prime length and the road coloring problem ⋮ A note on the rank of semigroups. ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ The road coloring problem ⋮ Černý's conjecture and the road colouring problem ⋮ Structure of free semigroupoid algebras

Cites Work

• Zero-inducing functions on finite Abelian groups
• Equivalence of topological Markov shifts
• Unnamed Item

This page was built for publication: The road-colouring problem