The list linear arboricity of planar graphs with 7-cycles containing at most two chords

Renyu Xu

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: A graph G is linear-k-choosable if for any edge assignment L={L(e):e∈E(G)} of k positive integers, there exists an edge-coloring φ of G such that each color class induces a linear forest and φ(e) ∈ L(e) for all e ∈ E(G). In this paper, we prove that if G is a planar graph such that every 7-cycle of G contains at most two chords, then G is linear ⌈Δ+12⌉-choosable if Δ(G) ≥ 6, and G is linear ⌈Δ2⌉-choosable if Δ(G) ≥ 11.

Keywords: List coloring; Linear arboricity; List linear arboricity; Planar graph (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031930548X
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:363:y:2019:i:c:8

DOI: 10.1016/j.amc.2019.124565

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