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.
A lower bound for the hadwiger number of a graph as a function of the average degree of its vertices.Diskret
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
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.