A note on partitions of graphs under degree constraints

DOI10.1016/J.DAM.2020.03.014zbMATH Open1442.05181OpenAlexW3011148276MaRDI QIDQ2192117FDOQ2192117

Authors: Chunlei Zu 

Publication date: 29 June 2020

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

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

Recommendations

• On partitions of graphs under degree constraints
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• On decomposition of triangle-free graphs under degree constraints
• On a conjecture of Schweser and Stiebitz
• Partitions of graphs and multigraphs under degree constraints

zbMATH Keywords

degree constraintfeasible partition\( \{ K_3, K_{2, 3} \}\)-free graph

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?)
• 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
• Partitions of multigraphs under minimum degree constraints
• Efficient algorithms for decomposing graphs under degree constraints
• On partitions of graphs under degree constraints
• Graph decomposition with constraints in the minimum degree
• Decomposing weighted graphs
• Decomposing edge-colored graphs under color degree constraints
• Internal partitions of regular graphs
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Decomposing \(C_4\)-free graphs under degree constraints

Cited In (12)

• On partitions of graphs under degree constraints
• Degree conditions for the partition of a graph into triangles and guadrilaterals
• A note on formulations for the \(A\)-partition problem on hypergraphs
• A generalization of Stiebitz-type results on graph decomposition
• On a conjecture of Schweser and Stiebitz
• Bipartitions based on degree constraints
• On connected partition with degree constraints
• A note on non-dominating set partitions in graphs
• Efficient algorithms for decomposing graphs under degree constraints
• Partitions of multigraphs without \(C_4\)
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Partitions of hypergraphs under variable degeneracy constraints

This page was built for publication: A note on partitions of graphs under degree constraints

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