Name
Abstract | ||
|---|---|---|
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jctb.2016.11.004 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Chromatic number,Crossing number,List coloring | Graph,Discrete mathematics,Combinatorics,Crossing number (graph theory),Graph power,Vertex (geometry),List coloring,1-planar graph,Planar graph,Mathematics,Graph coloring | Journal |
Volume | ISSN | Citations |
123 | 0095-8956 | 3 |
PageRank | References | Authors |
0.43 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zdeněk Dvořák | 1 | 123 | 22.91 |
| Bernard Lidický | 2 | 9 | 5.00 |
| Bojan Mohar | 3 | 1523 | 192.05 |