Yayınlanmış 1 Ocak 2019
| Sürüm v1
Dergi makalesi
Açık
Bounding the chromatic number of squares of K-4-minor-free graphs
Oluşturanlar
- 1. Suleyman Demirel Univ, Dept Math, TR-32260 Isparta, Turkey
- 2. Duzce Univ, Dept Math, TR-81620 Duzce, Turkey
Açıklama
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.
Dosyalar
bib-a6a0daf9-29e6-4a96-9796-622ad97b0951.txt
Dosyalar
(148 Bytes)
| Ad | Boyut | Hepisini indir |
|---|---|---|
|
md5:a5b886c8230f0cf21abc4bf7ae05b5cc
|
148 Bytes | Ön İzleme İndir |