Partitions of graphs with high minimum degree or connectivity.

DOI10.1016/S0095-8956(03)00028-5zbMath1045.05075OpenAlexW2066526134MaRDI QIDQ1405098

Daniela Kühn, Deryk Osthus

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(03)00028-5

zbMATH Keywords

connectivityminimum degreegraph partitions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Bipartitions of highly connected tournaments ⋮ Vertex-disjoint subgraphs with high degree sums ⋮ Degree-constrained 2-partitions of graphs ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ On the parameterized complexity of 2-partitions ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A weaker version of Lovász' path removal conjecture ⋮ On splitting digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Nested cycles with no geometric crossings

Cites Work

• Partition of graphs with condition on the connectivity and minimum degree
• Exact bounds for judicious partitions of graphs
• Induced paths in 5-connected graphs
• Graph decomposition with constraints on the connectivity and minimum degree
• Graph decomposition with applications to subdivisions and path systems modulo k
• Nonseparating cycles inK-Connected graphs
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item