arXiv (All)
open access
A tris of perfect matchings in bridgeless claw-free cubic graphs
A proof of the cycle double cover conjecture was recently announced, yielding an $8$-cycle double cover for every bridgeless graph. The stronger $5$-cycle double cover conjecture, which is still open, is equivalent to the statement that the edge set of every bridgeless claw-free cubic graph can be c
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
- Erdős-Hajnal conjecture beyond five-vertex graphs#798944
- Erdős-Hajnal conjecture beyond five-vertex graphs#797530
- B-coloring of $K_{2,t}$-free planar graphs#1070014
- Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948#997620
- Hamiltonian graphs with prescribed minimum degree and no near-spanning cycles#972532
Record · ID 1064662
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