Distribution of vertices required a high-degree condition on partitions of graphs under degree constraints

DOI10.1002/JGT.23228MaRDI QIDQ6978646zbMATH OpenFDO

Authors Michitaka Furuya, Shun-ichi Maezawa

Publication date 27 May 2025

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

Full work available at URL https://doi.org/10.1002/JGT.23228

zbMATH Keywords

degree constraintfeasible partitionStiebitz's theorem

Mathematics Subject Classification ID

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

Cites work

• A generalization of Stiebitz-type results on graph decomposition
• Decomposing C₄-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints
• Graph decomposition with constraints on the connectivity and minimum degree
• Graph theory
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• 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 graphs and multigraphs under degree constraints
• Partitions of multigraphs under minimum degree constraints
• Partitions of multigraphs without \(C_4\)
• Some remarks on even-hole-free graphs
• The Erdős-Lovász Tihany conjecture and complete minors

This page was built for publication: Distribution of vertices required a high-degree condition 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 Q6978646)