Name
Abstract | ||
|---|---|---|
A 1-planar graph is a graph that can be drawn in the Euclidean plane such that each edge crosses at most one edge. An independent crossing (IC)-planar graph is a 1-planar graph satisfying the condition that two pairs of crossing edges have no common end-vertices. It is shown in this paper that every IC-planar graph is 6-choosable. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1137/20M133261X | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
1-planar graph, IC-planar graph, choosability, list coloring | Journal | 35 |
Issue | ISSN | Citations |
3 | 0895-4801 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wanshun Yang | 1 | 0 | 0.34 |
| Yiqiao Wang | 2 | 494 | 42.81 |
| Wei-Fan Wang | 3 | 0 | 0.34 |
| Ko-wei Lih | 4 | 529 | 58.80 |