arXiv (All)
open access
Local Clique Covers and Chromatic Number
The local clique cover number $lcc(G)$ is the minimum valency of an edge-clique cover of $G$. We prove the conjectured inequality $lcc(G)+χ(G)\le |V(G)|+1$ for every finite simple graph. The proof gives an independent set improvement of an endpoint-cover estimate and applies the resulting constructi
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
- Vizing's theorem for signed multigraphs#1117820
- Independent domination in central graphs#1110720
- Locally bipartite subgraphs via multicolor Ramsey numbers#984213
- Characterizing optimal monitoring edge-geodetic sets for some structured graph classes#14161
- The Erdős--Chvátal Simplex Conjecture#1083902
Record · ID 985390
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