arXiv (All)
open access
The Partial List Colouring Conjecture is False
We exhibit a graph $G$ with $14$ vertices and list chromatic number equal to $3$ such that there is a $2$-list assignment $L$ of $G$ such that at most $9$ vertices of $G$ can be properly coloured from $L$. This disproves the Partial List Colouring Conjecture of Albertson, Grossman and Haas. This cou
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
- Graph Coloring with Color Preferences#820007
- A variety of the mutual-visibility coloring problem for graphs#1106126
- On reducible partition of graphs and its application to Hadwiger conjecture#821635
- Contribution à l'étude de quelques problèmes de coloration de graphes#370924
- On Edge Coloring of Multigraphs#1082904
Record · ID 1049034
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