arXiv (All)
open access
Completely Reachable Road Coloring
We characterize the digraphs that admit an edge labeling by letters from a finite alphabet such that the resulting labeled digraph is a completely reachable automaton. This class of digraphs can be recognized in polynomial time. In contrast, we show that, for every fixed alphabet size, the problem o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Finer View of the Parameterized Landscape of Labeled Graph Contractions#1049684
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#799032
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#797617
- A New Method that can Generate Ramsey Colourings for Eight and Thirteen Colours#1063062
- Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles#725168
Record · ID 800101
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive