On partitions of K₂, 3-free graphs under degree constraints

DOI10.1016/J.DISC.2018.08.015MaRDI QIDQ1800399zbMATH OpenOpenAlexFDO

Authors Jiguo Yu, Xia Zhang, Jianfeng Hou, Hua Wen Ma

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

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

Recommendations

• On partitions of graphs under degree constraints
• A note on partitions of graphs under degree constraints
• On connected partition with degree constraints
• On decomposition of triangle-free graphs under degree constraints
• Partitions of graphs and multigraphs under degree constraints

Cites work

• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Bipartitions of oriented graphs
• Bisections of graphs without short cycles
• Bounds for pairs in judicious partitioning of graphs
• Decomposing graphs with girth at least five under degree constraints
• Exact bounds for judicious partitions of graphs
• Graph decomposition with constraints on the connectivity and minimum degree
• Judicious partitioning of hypergraphs with edges of size at most 2
• On decomposition of triangle-free graphs under degree constraints
• On judicious bisections of graphs
• On judicious partitions of uniform hypergraphs
• On partitions of graphs under degree constraints
• On several partitioning problems of Bollobás and Scott
• On splitting digraphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs

Cited in

(13)

• A note on partitions of graphs under degree constraints
• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Graph partition into \(K_{3}\)s and \(K_{4}\)s
• Graph partitioning: an updated survey
• A generalization of Stiebitz-type results on graph decomposition
• On a conjecture of Schweser and Stiebitz
• Partitions of graphs and multigraphs under degree constraints
• Graph partitions under average degree constraint
• On connected partition with degree constraints
• Partitions of multigraphs without \(C_4\)
• Maximum bisections of graphs with girth at least six
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800399)