Discrete MathematicsVolume 309, Issues 23–24, 6 December 2009, Pages 6572-6584A Brooks-type bound for squares of K4-minor-free graphsAuthor links open overlay panelAlexandr V. Kostochka a b, Lale Özkahya a, Douglas R. Woodall cShow moreShareCitehttps://doi.org/10.1016/j.disc.2009.07.004Get rights and contentUnder an Elsevier user licenseopen archiveAbstractRefining a bound by Lih, Wang and Zhu, we prove that if the square G2 of a K4-minor-free graph G with maximum degree Δ⩾6 does not contain a complete subgraph on ⌊32Δ⌋+1 vertices, then G2 is ⌊32Δ⌋-colorable.Previous article in issueNext article in issueKeywordsChromatic numberVertex coloringBrooks-type boundSquare of a graphSeries–parallel graphRecommended articlesCited by (0)Copyright © 2009 Elsevier B.V. All rights reserved.