On the Number of Synchronizing Colorings of Digraphs
From MaRDI portal
Publication:2947415
DOI10.1007/978-3-319-22360-5_11zbMath1465.05083arXiv1508.02133OpenAlexW3105820180MaRDI QIDQ2947415
Marek Szykuła, Vladimir V. Gusev
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.02133
Formal languages and automata (68Q45) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Complexity of road coloring with prescribed reset words ⋮ Černý's conjecture and the road colouring problem
Cites Work
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- A monotonicity formula for stationary biharmonic maps
- The dynamic stability of a rotating pre-twisted asymmetric cross-section Timoshenko beam subjected to lateral parametric excitation
- Equivalence of topological Markov shifts
- Černý's conjecture and the road colouring problem
- Complexity of road coloring with prescribed reset words
- Practical graph isomorphism. II.
- On the Probability of Being Synchronizable
- P–NP Threshold for Synchronizing Road Coloring
- Synchronizing Automata with Extremal Properties
- Reset Thresholds of Automata with Two Cycle Lengths
- Reset Sequences for Monotonic Automata
- Synchronizing Automata and the Černý Conjecture
- Generating Small Automata and the Černý Conjecture
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: On the Number of Synchronizing Colorings of Digraphs
