Indexed metadata

Decomposing multigraphs into two Class I subgraphs with prescribed maximum degrees

Yonglei Chen, Yan Cao

Source record

Source: arXiv

Published: Oct 15, 2026

arXiv: 2610.21097

Open original source ↗

Source abstract

Let GG be a finite loopless multigraph with maximum degree ΔΔ and χ′(G)=Δ+kχ'(G)=Δ+k, where k≥0k\ge0. We prove that for every pair of positive integers p,qp,q satisfying p+q=Δ+kandp,q≤Δ,p+q=Δ+k\qquad\text{and}\qquad p,q\leΔ, the graph GG admits an edge decomposition into two spanning Class I subgraphs Hp,HqH_p,H_q with Δ(Hp)=pandΔ(Hq)=q.Δ(H_p)=p \qquad\text{and}\qquad Δ(H_q)=q.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.