| dc.creator |
Deniz, Zakir |
|
| dc.creator |
CİVAN, Yusuf |
|
| dc.creator |
YETİM, Mehmet Akif |
|
| dc.date |
2019-06-30T21:00:00Z |
|
| dc.date.accessioned |
2020-10-06T11:25:22Z |
|
| dc.date.available |
2020-10-06T11:25:22Z |
|
| dc.identifier |
d862692a-a06f-45a0-8737-eaa76db5749b |
|
| dc.identifier |
10.1016/j.disc.2019.03.011 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/d862692a-a06f-45a0-8737-eaa76db5749b/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/73384 |
|
| dc.description |
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. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Bounding the chromatic number of squares of K-4-minor-free graphs |
|
| dc.type |
info:eu-repo/semantics/article |
|