Every n-vertex H-minor-free graph admits a 3-coloring with monochromatic components of size O_H(n^{4/9}).
Partitioning H-minor free graphs into three subgraphs 18 with no large components.Journal of Combinatorial Theory, Series B, 128:114–133, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
3-Colouring Graphs Excluding a Fixed Minor
Every n-vertex H-minor-free graph admits a 3-coloring with monochromatic components of size O_H(n^{4/9}).