Verifies stronger coarse balanced separator conjecture for all r in K_{t,t}-induced-minor-free graphs of bounded clique number via a polynomial-size hitting set Z for large balls on any Y.
Tree-width dichotomy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.
citing papers explorer
-
Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs
Verifies stronger coarse balanced separator conjecture for all r in K_{t,t}-induced-minor-free graphs of bounded clique number via a polynomial-size hitting set Z for large balls on any Y.
-
An Overview of Universal Obstructions for Graph Parameters
The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.