On r-hued coloring of connected P5-free tripartite graphs

Yaxin Shi, Fengxia Liu and HongJian Lai

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

Abstract: A (k,r)-coloring of a graph G is a proper k-vertex coloring such that any vertex is adjacent to vertices with at least min{r,dG(v)}. The minimum integer k such that G has a (k,r)-coloring is called the r-hued chromatic number of G and denoted by χr(G). A graph does not have an induced subgraph isomorphic to P5 is a P5-free graph. It is not known whether it is valid that χr(G)≤rχ(G) among all P5-free graphs. In [Discrete Math. 342(2019)1904-1911], an affirmative answer is presented for all graphs G with χ(G)≤2. We verify that if G is a P5-free graph with χ(G)≤3, then χr(G)≤rχ(G).

Keywords: (k,r)-coloring; Tripartite graph; r-hued chromatic number (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003229
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:479:y:2024:i:c:s0096300324003229

DOI: 10.1016/j.amc.2024.128861

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 ().