arXiv (OAI Expanded)
open access
List coloring $C_3$-free planar graphs with a sparse matching of restricted lists
A graph $G$ is $k$-choosable if it has a proper coloring for every $k$-list assignment. While every $C_3$-free planar graph is $4$-choosable, some of them are not $3$-choosable, as constructed by Voigt. Hu and Zhu conjectured that if $G$ is a $C_3$-free planar graph and $X \subseteq V(G)$ induces a
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
- Multicolor Ramsey numbers of odd cycles are superexponential#984214
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- Degreewise Cut-Semigroup Saturation for $K_5$-Minor-Free Graphs and Seymour's Planar Edge-Colouring Conjecture#1070206
Record · ID 809740
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