A balanced separator of size O(h √(log h) √n) for K_h-minor-free graphs is constructed by adding low-diameter decompositions to the Alon-Seymour-Thomas iterative framework.
Polynomial bounds for the graph minor structure theorem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.
citing papers explorer
-
A Separator for Minor-Free Graphs Beyond the Flow Barrier
A balanced separator of size O(h √(log h) √n) for K_h-minor-free graphs is constructed by adding low-diameter decompositions to the Alon-Seymour-Thomas iterative framework.
-
Colorful Minors
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.