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

DOI10.1016/J.ENDM.2015.06.020MaRDI QIDQ5890901zbMATH OpenOpenAlexFDO

Authors Chun-Hung Liu, Sang-Il Oum

Publication date 14 October 2016

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.020

zbMATH Keywords

coloringgraph minorspartitioning

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Recommendations

• Partitioning \(H\)-minor free graphs into three subgraphs with no large components
• Partitioning into graphs with only small components
• scientific article; zbMATH DE number 1870233
• A Separator Theorem for Nonplanar Graphs
• On vertex partitions and some minor-monotone graph parameters

Cites work

• A relative of Hadwiger's conjecture
• A relaxed Hadwiger's conjecture for list colorings
• Colouring planar graphs with three colours and no large monochromatic components
• Contractibility and the Hadwiger conjecture
• Graph minors. XVI: Excluding a non-planar graph
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Partitioning into graphs with only small components

Cited in

(3)

• On vertex partitions and some minor-monotone graph parameters
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components
• Clustered coloring of (path + 2K₁)-free graphs on surfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890901)