Decomposing multigraphs into two Class I subgraphs with prescribed maximum degrees
Yonglei ChenYan Cao
所有作者
Yonglei ChenYan Cao
文献摘要
Let G be a finite loopless multigraph with maximum degree Δ and χ′(G)=Δ+k, where k≥0. We prove that for every pair of positive integers p,q satisfying p+q=Δ+kandp,q≤Δ, the graph G admits an edge decomposition into two spanning Class I subgraphs Hp,Hq with Δ(Hp)=pandΔ(Hq)=q.