On partitions of graphs under degree constraints

DOI10.1016/j.dam.2017.04.007zbMath1365.05232OpenAlexW2607945530MaRDI QIDQ2357778

Muhuo Liu, Bao-Gang Xu

Publication date: 14 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.007

zbMATH Keywords

subgraph\((K_4 - e)\)-free graphs

Mathematics Subject Classification ID

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

Related Items (11)

On a conjecture of Schweser and Stiebitz ⋮ On connected partition with degree constraints ⋮ Partitions of graphs and multigraphs under degree constraints ⋮ Degree-constrained 2-partitions of graphs ⋮ A note on partitions of graphs under degree constraints ⋮ Graph partitions under average degree constraint ⋮ Partitions of multigraphs under minimum degree constraints ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ On partitions of \(K_{2, 3}\)-free graphs under degree constraints ⋮ Partitions of multigraphs without \(C_4\) ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition

Cites Work

• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• Efficient algorithms for decomposing graphs under degree constraints
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• 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

This page was built for publication: On partitions of graphs under degree constraints