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


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

DISCRETE MATHEMATICS, cilt.342, ss.1894-1903, 2019 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 342 Konu: 7
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1016/j.disc.2019.03.011
  • Dergi Adı: DISCRETE MATHEMATICS
  • Sayfa Sayıları: ss.1894-1903

Özet

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.