2-Distance choosability of planar graphs with a restriction for maximum degree

Jiahao Yu, Min Chen and Weifan Wang

Applied Mathematics and Computation, 2023, vol. 448, issue C

Abstract: A proper k-coloring of a graph G is a 2-distance k-coloring of G if each pair of vertices with distance no more than 2 are colored differently. We call G is 2-distance L-colorable if it has a 2-distance coloring π such that π(v)∈L(v), where L={L(v)∣v∈V} is a list assignment of G. Similarly, G is called to be 2-distance k-choosable if there is a 2-distance L-coloring of G such that any list assignment L satisfies |L(v)|≥k for each v∈V(G). The 2-distance list chromatic number of G, denoted by χ2l(G), is the minimum positive integer k such that G is 2-distance k-choosable. In this paper, we prove that every planar graph G with maximum degree Δ has χ2l(G)≤18 if Δ≤5, and χ2l(G)≤4Δ−3 if Δ≥6.

Keywords: Planar graph; 2-Distance coloring; 2-Distance choosability; Maximum degree (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323001182
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:448:y:2023:i:c:s0096300323001182

DOI: 10.1016/j.amc.2023.127949

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