arXiv (All)
open access
Hilton-Zhao vertex-splitting conjecture for triangle-free graphs
Every graph obtained from a regular Class $1$ graph by a vertex-splitting is overfull and hence is of Class $2$; the central question is whether the resulting graph is edge-chromatic critical. We consider a revised version of the Hilton-Zhao vertex-splitting conjecture for triangle-free base graphs,
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
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#819736
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#809740
- Multicolor Ramsey numbers of odd cycles are superexponential#984214
- Packing colourings of claw-free subcubic graphs#1456626
- Elementary Proofs of Commonality of the House Graph and $K_4$ with One Edge Subdivided#1355083
Record · ID 1535299
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