On partitions of \(K_{2, 3}\)-free graphs under degree constraints

DOI10.1016/j.disc.2018.08.015zbMath1397.05140OpenAlexW2890976643MaRDI QIDQ1800399

Jiguo Yu, Xia Zhang, Hua Wen Ma, Jian-Feng Hou

Publication date: 23 October 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.015

zbMATH Keywords

degeneracyfeasible partition\(K_{2, 3}\)-free graphssatisfactory

Mathematics Subject Classification ID

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

Related Items (8)

On a conjecture of Schweser and Stiebitz ⋮ On connected partition with degree constraints ⋮ Partitions of graphs and multigraphs under degree constraints ⋮ A note on partitions of graphs under degree constraints ⋮ Graph partitioning: an updated survey ⋮ Graph partitions under average degree constraint ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Partitions of multigraphs without \(C_4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious partitions of uniform hypergraphs
• On judicious bisections of graphs
• On several partitioning problems of Bollobás and Scott
• Bipartitions of oriented graphs
• On splitting digraphs
• Exact bounds for judicious partitions of graphs
• On partitions of graphs under degree constraints
• Bounds for pairs in judicious partitioning of graphs
• Graph decomposition with constraints on the connectivity and minimum degree
• On decomposition of triangle-free graphs under degree constraints
• Bisections of Graphs Without Short Cycles
• Problems and results on judicious partitions
• Decomposing graphs with girth at least five under degree constraints
• Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: On partitions of \(K_{2, 3}\)-free graphs under degree constraints