Decomposing C4‐free graphs under degree constraints

DOI10.1002/jgt.22364zbMath1414.05239arXiv1706.07292OpenAlexW2964267181MaRDI QIDQ5379812

Tianchi Yang, Jie Ma

Publication date: 14 June 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.07292

zbMATH Keywords

degree constraints\(C_4\)-free graphsfeasible partitionStiebitz's theorem

Mathematics Subject Classification ID

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

Related Items (12)

On a conjecture of Schweser and Stiebitz ⋮ On connected partition with degree constraints ⋮ Partitions of graphs and multigraphs under degree constraints ⋮ A note on partitions of graphs under degree constraints ⋮ Graph partitioning: an updated survey ⋮ A note on internal partitions: the 5-regular case and beyond ⋮ Graph partitions under average degree constraint ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ A generalization of Stiebitz-type results on graph decomposition ⋮ Partitions of multigraphs without \(C_4\) ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ (Dis)assortative partitions on random regular graphs

This page was built for publication: Decomposing C₄‐free graphs under degree constraints