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

DOI10.1016/J.DISC.2018.08.015zbMATH Open1397.05140OpenAlexW2890976643MaRDI QIDQ1800399FDOQ1800399

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

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

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)

Cites Work

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

Cited In (13)

• 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
• A note on partitions of graphs under degree constraints

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)