On a conjecture of Schweser and Stiebitz
From MaRDI portal
Publication:2661211
DOI10.1016/j.dam.2021.02.028zbMath1460.05157OpenAlexW3135580744WikidataQ113877248 ScholiaQ113877248MaRDI QIDQ2661211
Publication date: 1 April 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.028
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items
On connected partition with degree constraints ⋮ Partitions of graphs and multigraphs under degree constraints ⋮ Graph partitions under average degree constraint ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Partitions of multigraphs without \(C_4\) ⋮ (Dis)assortative partitions on random regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for decomposing graphs under degree constraints
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Partitions of multigraphs under minimum degree constraints
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- Partitions of multigraphs without \(C_4\)
- Partitions of graphs and multigraphs under degree constraints
- A note on partitions of graphs under degree constraints
- On partitions of graphs under degree constraints
- Graph decomposition with constraints on the connectivity and minimum degree
- On decomposition of triangle-free graphs under degree constraints
- Decomposing graphs with girth at least five under degree constraints
- Decomposing Weighted Graphs
- Decomposing C4‐free graphs under degree constraints
