List-colouring the square of an outerplanar graph
Timothy J. Hetherington, Woodall · Nottingham Trent University's Institutional Repository (Nottingham Trent Repository) · 2011
It is proved that if G is a K2,3-minor-free graph with maximum degree ∆, then ∆ + 1 6 χ(G) 6 ch(G) 6 ∆ + 2 if ∆ > 3, and ch(G) = χ(G) = ∆ + 1 if ∆ > 6. All inequalities here are sharp, even for outerplanar graphs.