An algorithm for road coloring
type: Item
instance of: scholarly article
title: An algorithm for road coloring
zbMATH Open document ID: 1262.68095
author: A. N. Trahtman
published in: Journal of Discrete Algorithms
publication date: 2013-01-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68-04
zbMATH DE Number: 6126828
zbMATH Keywords: road coloring
zbMATH Keywords: graph
zbMATH Keywords: deterministic finite automaton
zbMATH Keywords: synchronization
describes a project that uses: TESTAS
MaRDI profile type: Publication
full work available at URL: j.jda.2012.05.003
OpenAlex ID: W2568288801
cites work: Similarity of automorphisms of the torus
cites work: Equivalence of topological Markov shifts
cites work: Q4091421
cites work: Matrix Mortality and the Černý-Pin Conjecture
cites work: Slowly Synchronizing Automata and Digraphs
cites work: A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
cites work: Q4523963
cites work: Cycles of relatively prime length and the road coloring problem
cites work: The Synchronization Problem for Strongly Transitive Automata
cites work: Q5629545
cites work: A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
cites work: On the Road Coloring Problem
cites work: A note on the road-coloring conjecture
cites work: Q3576704
cites work: Q4224886
cites work: Q4779162
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Q4266486
cites work: The road-colouring problem
cites work: Q4037012
cites work: Decision Version of the Road Coloring Problem Is NP-Complete
cites work: Q4864787
cites work: Depth-First Search and Linear Graph Algorithms
cites work: The road coloring problem
cites work: An Algorithm for Road Coloring
DOI: 10.1016/J.JDA.2012.05.003
description: scientific article; zbMATH DE number 6126828