A generalization of Stiebitz-type results on graph decomposition

DOI10.37236/9757zbMath1475.05153arXiv2009.02175OpenAlexW3174697660MaRDI QIDQ2034069

Chunlei Zu, Qinghou Zeng

Publication date: 21 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.02175

zbMATH Keywords

vertex partitionmultigraph decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items

Graph partitioning: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for decomposing graphs under degree constraints
• Graph decomposition with constraints in the minimum degree
• Decomposing edge-colored graphs under color degree constraints
• Partitions of multigraphs under minimum degree constraints
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Partitions of graphs and multigraphs under degree constraints
• A note on partitions of graphs under degree constraints
• On partitions of graphs under degree constraints
• On a conjecture of Schweser and Stiebitz
• Internal Partitions of Regular Graphs
• Graph decomposition with constraints on the connectivity and minimum degree
• On decomposition of triangle-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints
• Decomposing Weighted Graphs
• Decomposing C₄‐free graphs under degree constraints