Partitioning \(H\)-minor free graphs into three subgraphs with no large components

DOI10.1016/j.jctb.2017.08.003zbMath1375.05217arXiv1503.08371OpenAlexW3102574461MaRDI QIDQ5915769

Chun-Hung Liu, Sang-il Oum

Publication date: 28 November 2017

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

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

zbMATH Keywords

vertex partitionsgraph minorsodd minorssmall components

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (6)

Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Improved bound for improper colourings of graphs with no odd clique minor ⋮ Clustered 3-colouring graphs of bounded degree ⋮ Clustered variants of Hajós' conjecture ⋮ Improper colouring of graphs with no odd clique minor ⋮ Immersion and clustered coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractibility and the Hadwiger conjecture
• A relaxed Hadwiger's conjecture for list colorings
• On tree-partition-width
• Graph minors. X: Obstructions to tree-decomposition
• Excluding a countable clique
• Partitioning into graphs with only small components
• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. IX: Disjoint crossed paths
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Graph minors. XIV: Extending an embedding
• On the odd-minor variant of Hadwiger's conjecture
• Structural sparsity
• A Relative of Hadwiger's Conjecture
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Some results on tree decomposition of graphs
• Colouring Planar Graphs With Three Colours and No Large Monochromatic Components

This page was built for publication: Partitioning \(H\)-minor free graphs into three subgraphs with no large components