Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.dam.2018.03.014 | Discrete Applied Mathematics |
Keywords | Field | DocType |
List coloring,Planar graph,Cycle,Chord | Graph,Discrete mathematics,Combinatorics,Colored,Vertex (geometry),Chordal graph,Planar graph,Mathematics | Journal |
Volume | ISSN | Citations |
244 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daiqiang Hu | 1 | 7 | 2.50 |
| Danjun Huang | 2 | 77 | 9.89 |
| Weifan Wang | 3 | 868 | 89.92 |
| Jian-Liang Wu | 4 | 74 | 12.73 |