A note on partitions of graphs under degree constraints
From MaRDI portal
Publication:2192117
Recommendations
Cites work
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- Decomposing \(C_4\)-free graphs under degree constraints
- Decomposing graphs with girth at least five under degree constraints
- Decomposing weighted graphs
- Efficient algorithms for decomposing graphs under degree constraints
- Graph decomposition with constraints in the minimum degree
- Graph decomposition with constraints on the connectivity and minimum degree
- Internal partitions of regular graphs
- On decomposition of triangle-free graphs under degree constraints
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- On partitions of graphs under degree constraints
- Partitions of multigraphs under minimum degree constraints
Cited in
(13)- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- On partitions of graphs under degree constraints
- Partitions of hypergraphs under variable degeneracy constraints
- A generalization of Stiebitz-type results on graph decomposition
- Partitions of multigraphs without \(C_4\)
- On connected partition with degree constraints
- On a conjecture of Schweser and Stiebitz
- Bipartitions based on degree constraints
- A note on non-dominating set partitions in graphs
- Degree conditions for the partition of a graph into triangles and guadrilaterals
- Efficient algorithms for decomposing graphs under degree constraints
- Graph partitions under average degree constraint
- A note on formulations for the \(A\)-partition problem on hypergraphs
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)