Name
Abstract | ||
|---|---|---|
Abstract A plane graph \(G\) is entirely \(k\)-choosable if, for every list \(L\) of colors satisfying \(L(x)=k\) for all \(x\in V(G)\cup E(G) \cup F(G)\), there exists a coloring which assigns to each vertex, each edge and each face a color from its list so that any adjacent or incident elements receive different colors. In 1993, Borodin proved that every plane graph \(G\) with maximum degree \(\Delta \ge 12\) is entirely \((\Delta +2)\)-choosable. In this paper, we improve this result by replacing 12 by 10. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10878-014-9819-9 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Plane graph,Entire choosability,Maximum degree | Graph,Combinatorics,Vertex (geometry),Degree (graph theory),Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
31 | 3 | 1573-2886 |
Citations | PageRank | References |
1 | 0.37 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Tingting Wu | 2 | 2 | 0.73 |
| Xiaoxue Hu | 3 | 7 | 4.25 |
| Yiqiao Wang | 4 | 494 | 42.81 |