A note on the road-coloring conjecture (Q2713622)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the road-coloring conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the road-coloring conjecture |
scientific article |
Statements
10 June 2001
0 references
road-coloring conjecture
0 references
directed graphs
0 references
A note on the road-coloring conjecture (English)
0 references
This paper contains some results related to the road-coloring conjecture of Alder, Goodwyn, and Weiss. Using probabilistic methods, it is shown that if \(\delta =\Omega (\log n)\), then the road-coloring conjecture is true for almost every strongly connected aperiodic directed graph on \(n\) vertices of outdegree \(\delta \). An \(O(n^2)\) algorithm for determining whether or not a particular road-coloring is a resolving one is also given.
0 references
