arXiv (All)
open access
Yes, $(2K_2, K_4)$-free graphs are recolorable
We prove that every $(2K_2,K_4)$-free graph is recolorable. Equivalently, for every such graph $G$ and every $\ell\geq χ(G)+1$, the reconfiguration graph of proper $\ell$-colorings of $G$, in which two colorings are adjacent if they differ on exactly one vertex, is connected. This resolves the final
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
- Periodic efficient total girth colorings in cubic maps of girth 4 correspond to 3-permutation face colorings#1130180
- Last two pieces of the puzzle for unsolvability of a system of two quadratic (in)equalities#799761
- Herstories : les archives du collectif artistique féministe Double X (Los Angeles, 1975-1985)#142711
- Recognizability equals CMSO-definability for graphs of rank-width at most two#998295
- Improving Graph Neural Networks by Learning Continuous Edge Directions.#1054041
Record · ID 1076549
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