arXiv (All)
open access
On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor
Let $G$ be a cubic graph admitting a $2$-factor consisting of exactly two odd circuits, and let the complementary $1$-factor contain precisely three spokes (along with an arbitrary number of chords). We show that four perfect matchings can cover $G$. As a consequence, $G$ fulfils the 7/5-Conjecture
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
- Explicit Fractalizers: Prime-Order Paley Graphs and other Cayley Graphs#1118238
- FPT Isomorphism Test for $F$-Free Tournaments#1051205
- k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs#997973
- On the failure of the $12\%$ rule in $J/ψ$ and $ψ(2S)$ decays#1051355
- Exceptional Collections of Line Bundles for Smooth Toric Fano Surfaces and Threefolds#612719
Record · ID 1105043
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