Bounding the chromatic number of squares of K-4-minor-free graphs
| dc.contributor.author | Civan, Yusuf | |
| dc.contributor.author | Deniz, Zakir | |
| dc.contributor.author | Yetim, Mehmet Akif | |
| dc.date.accessioned | 2020-04-30T22:40:19Z | |
| dc.date.available | 2020-04-30T22:40:19Z | |
| dc.date.issued | 2019 | |
| dc.department | DÜ, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.description | Deniz, Zakir/0000-0002-0701-0397 | en_US |
| dc.description | WOS: 000471088300003 | en_US |
| dc.description.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. | en_US |
| dc.description.sponsorship | TUBITAK-BIDEB, 2211 Ph.D. scholarship programme | en_US |
| dc.description.sponsorship | We thank anonymous referees for carefully reading our manuscript and for their invaluable comments and suggestions which substantially instigated many improvements on the readability of the material. The second and last authors are supported by TUBITAK-BIDEB, 2211 Ph.D. scholarship programme. | en_US |
| dc.identifier.doi | 10.1016/j.disc.2019.03.011 | en_US |
| dc.identifier.endpage | 1903 | en_US |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.issn | 1872-681X | |
| dc.identifier.issue | 7 | en_US |
| dc.identifier.scopusquality | Q1 | en_US |
| dc.identifier.startpage | 1894 | en_US |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2019.03.011 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12684/2955 | |
| dc.identifier.volume | 342 | en_US |
| dc.identifier.wos | WOS:000471088300003 | en_US |
| dc.identifier.wosquality | Q3 | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier Science Bv | en_US |
| dc.relation.ispartof | Discrete Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | K-4-minor-free graph | en_US |
| dc.subject | Square graph | en_US |
| dc.subject | Chromatic number | en_US |
| dc.title | Bounding the chromatic number of squares of K-4-minor-free graphs | en_US |
| dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 2955.pdf
- Boyut:
- 408.85 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin / Full Text
