🌐EnglishEnglishEspañolFrançaisPortuguêsSvenskaTiếng ViệtTürkçeРусскийEntityQ1937896· pop 9· linked from 8 articlesRoad coloring problemtheorem that every aperiodic strongly-connected out-regular directed graph can be labeled to give a synchronizable deterministic finite automatonAvailable in 9 languagesEspañolFrançaisРусскийPortuguêsHebrewSvenskaTiếng ViệtTürkçevia Wikidata sitelinks · CC0Connectionsdirected graphEntityprime numberEntityCategoriesAutomata (computation)CombinatoricsGraph coloringMathematics and cultureTheorems in graph theoryTopological graph theory