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

CİVAN, Yusuf; Deniz, Zakir; YETİM, Mehmet

doi:10.1016/j.disc.2019.03.011

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

CİVAN Y., Deniz Z., YETİM M. A.

DISCRETE MATHEMATICS, vol.342, no.7, pp.1894-1903, 2019 (SCI-Expanded, Scopus)

Publication Type: Article / Article
Volume: 342 Issue: 7
Publication Date: 2019
Doi Number: 10.1016/j.disc.2019.03.011
Journal Name: DISCRETE MATHEMATICS
Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Page Numbers: pp.1894-1903
Süleyman Demirel University Affiliated: Yes

Abstract

Let 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.