A partially synchronizing coloring

DOI10.1007/978-3-642-13182-0_36MaRDI QIDQ3569761zbMATH OpenOpenAlexFDO

Authors A. N. Trahtman

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13182-0_36

zbMATH Keywords

deterministic finite automatongraph algorithmroad coloringsynchronization

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An algorithm for road coloring
• An algorithm for road coloring
• The road coloring problem
• On the Number of Synchronizing Colorings of Digraphs
• Cycles of relatively prime length and the road coloring problem

Cited in

(9)

• An algorithm for road coloring
• A quadratic algorithm for road coloring
• An algorithm for road coloring
• scientific article; zbMATH DE number 1185607 (Why is no real title available?)
• On synchronizing colorings and the eigenvectors of digraphs
• A note on polynomial approximation of synchronizing optimal coloring
• Cycles of relatively prime length and the road coloring problem
• The road coloring problem
• Random walk in a finite directed graph subject to a road coloring

Describes a project that uses

Uses Software

• TESTAS

This page was built for publication: A partially synchronizing coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569761)