arXiv (All)
open access
Decomposing multigraphs into two Class I subgraphs with prescribed maximum degrees
Let $G$ be a finite loopless multigraph with maximum degree $Δ$ and $χ'(G)=Δ+k$, where $k\ge0$. We prove that for every pair of positive integers $p,q$ satisfying $$p+q=Δ+k\qquad\text{and}\qquad p,q\leΔ,$$ the graph $G$ admits an edge decomposition into two spanning Class I subgraphs $H_p,H_q$ with
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
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- A Counterexample to Teschner's Bondage-Number Conjecture#927557
- Forbidden Subgraphs of Graphs with Low Bandwidth#822364
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
Record · ID 1356433
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