On the Road Coloring Problem
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Synchronizing finite automata on Eulerian digraphs.
- An algorithm for road coloring
- Černý's conjecture and the road colouring problem
- A quadratic algorithm for road coloring
- A note on the road-coloring conjecture
- Modifying the upper bound on the length of minimal synchronizing word
- Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring
- A min-max theorem about the road coloring conjecture
- Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
- Cycles of relatively prime length and the road coloring problem
- A note on the rank of semigroups.
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
- The road coloring problem
- Random walk in a finite directed graph subject to a road coloring
- A vector space approach to the road coloring problem
This page was built for publication: On the Road Coloring Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970256)