arXiv (All)
open access
Acyclic Dichromatic Number of Tournaments: these are the Champions
The acyclic dichromatic number of an oriented graph is the minimum size of a vertex-partition such that the digraphs induced by any single part are acyclic, and the oriented bipartite graphs between any two parts are acyclic too. We characterize the subtournaments that must appear in every tournamen
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
- Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991
- Exact and extremal values of chromatic villainy#1297932
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- Monochromatic cycle partitions in 3-mean edge-colourings#1326368
Record · ID 1327463
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