Choosability with separation of planar graphs without prescribed cycles

Min Chen, Yingying Fan, André Raspaud, Wai Chee Shiu and Weifan Wang

Applied Mathematics and Computation, 2020, vol. 367, issue C

Abstract: In terms of constraining the list assignment, one refinement of k-choosability is considered as choosability with separation. We call a graph (k, d)-choosable if it is colorable from lists of size k where adjacent vertices have at most d common colors in their lists. If two cycles have exactly one common edge, then they are said to be normally adjacent.

Keywords: Choosability with separation; Planar graphs; List coloring; Adjacent cycles (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319307489
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:367:y:2020:i:c:s0096300319307489

DOI: 10.1016/j.amc.2019.124756

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