List Edge Colorings of Planar Graphs with 7-cycles Containing at Most Two Chords
DOI:
https://doi.org/10.22158/asir.v3n2p85Abstract
In this paper we prove that if G is a planar graph, and each 7-cycle contains at most two chords, then G is edge-k-choosable, where k = max{8, ?(G) + 1}.
Published
2019-04-30
Issue
Section
Articles
Copyright (c) 2019 Wenwen Zhang
This work is licensed under a Creative Commons Attribution 4.0 International License.
