| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871147 | Discrete Applied Mathematics | 2018 | 8 Pages |
Abstract
A graph G is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. In this paper, we prove that every planar graph without chordal 6-cycles is 4-choosable. This extends a known result that every planar graph without 6-cycles is 4-choosable.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dai-Qiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu,