Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 461, Issue -, Pages -Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2023.128314
Keywords
Chromatic number; Clique number; P5; k5-e
Categories
Ask authors/readers for more resources
The aim of this paper is to prove that a connected graph satisfying certain conditions is colorable.
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 toPK5 or K5 - G, then G is max{13, (13) + 1}-colorable.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
