Graphs with no K_{s+1}-subdivision are clustered-colorable with O(s) colors, and several stronger variants hold under almost (≤1)-subdivision and minor-free assumptions.
Improper coloring of graphs on surfaces.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Clustered Variants of Haj\'os' Conjecture
Graphs with no K_{s+1}-subdivision are clustered-colorable with O(s) colors, and several stronger variants hold under almost (≤1)-subdivision and minor-free assumptions.