Name
Abstract | ||
|---|---|---|
Let G be a planar graph, we prove that if every 5-cycle of G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.03.001 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Planar graph,Coloring,Choosability | Discrete mathematics,Outerplanar graph,Combinatorics,Edge-transitive graph,Graph power,Planar straight-line graph,Graph minor,Butterfly graph,Planar graph,Mathematics,Complement graph | Journal |
Volume | ISSN | Citations |
224 | 0166-218X | 2 |
PageRank | References | Authors |
0.41 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renyu Xu | 1 | 2 | 0.41 |
| Jian-Liang Wu | 2 | 4 | 1.46 |