Coloring graphs without induced P5 or K5 − e

Yian Xu

Applied Mathematics and Computation, 2024, vol. 461, issue C

Abstract: We use P5 to denote a path of length 5 and C5 to denote a cycle of length 5. The aim of this paper is to prove that, if G is a connected graph satisfying (1). G has an induced C5 and no clique cut-set, (2). G has no induced subgraph isomorphic to P5 or K5−e, then G is max⁡{13,ω(G)+1}-colorable.

Keywords: P5; K5−e; Chromatic number; Clique number (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323004836
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:461:y:2024:i:c:s0096300323004836

DOI: 10.1016/j.amc.2023.128314

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().