arXiv (All)
open access
Coloring Small $K_t$-Minor-Free Graphs
Delcourt and Postle proved that every $K_t$-minor-free graph is $O(t\log\log t)$-colorable and reduced the Linear Hadwiger Conjecture to coloring $K_t$-minor-free graphs on $O(t\log^4 t)$ vertices. In this paper, we use the star contraction technique to improve their bound for small graphs and use t
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
- An 18-colour bound for locally irregular decompositions#987111
- A Brooks-like result for graph powers $#983875
- The Borowiecki-Broere Generalized Total Coloring Conjecture for Planar Graphs#1154714
- More on Rainbow Cliques in Edge-Colored Graphs#1122876
- A note on efficient k-limited broadcast domination in graphs#659009
Record · ID 986042
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