arXiv (All)
open access
Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture
We prove the 3-Decomposition Conjecture: every finite connected cubic loopless multigraph decomposes into a spanning tree, a 2-regular subgraph, and a matching. The proof rests on a new theorem on matching complements in subcubic graphs. Let H be a finite connected bridgeless simple graph of maxim
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
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Outer-clique Roman dominating function in graphs#72023
- Bounds for Unions of Several Parts in Balanced Graph Partitions#1105486
- Near-bipartite bricks in which every b-invariant edge is a forcing edge#1070862
- Nordhaus--Gaddum relations for degrees and connectivities under the $δ$-complement#1014455
Record · ID 926194
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