List Edge Colorings of Planar Graphs with 7-cycles Containing at Most Two Chords

Wenwen Zhang


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}.

Full Text:




  • There are currently no refbacks.

Copyright (c) 2019 Wenwen Zhang

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © SCHOLINK INC.   ISSN 2474-4972 (Print)    ISSN 2474-4980 (Online)