Bounding the chromatic number of squares of K-4-minor-free graphs

Civan, YusufDeniz, ZakirYetim, Mehmet Akif2020-04-302020-04-3020190012-365X1872-681Xhttps://doi.org/10.1016/j.disc.2019.03.011https://hdl.handle.net/20.500.12684/2955Deniz, Zakir/0000-0002-0701-0397WOS: 000471088300003Let G be a K-4-minor-free graph with Delta(G) >= 3. We prove that if G contains no subgraph isomorphic to K-2(,r) for some r >= 1. then chi(G(2)) <= Delta(G) + r. (C) 2019 Elsevier B.V. All rights reserved.en10.1016/j.disc.2019.03.011info:eu-repo/semantics/closedAccessK-4-minor-free graphSquare graphChromatic numberBounding the chromatic number of squares of K-4-minor-free graphsArticle342718941903WOS:000471088300003Q1Q3