DSpace Repository

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

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

Deniz, Zakir; CİVAN, Yusuf; YETİM, Mehmet Akif
URI: http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/73384

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.

Show full item record

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Search DSpace


Browse

My Account