Name
Abstract | ||
|---|---|---|
A graph G is called an IC-planar graph if it can be embedded in the plane so that every edge is crossed by at most one other edge and every vertex is incident to at most one crossing edge. In this paper, we prove that every IC-planar graph is acyclically 10-colorable. Moreover, an IC-planar graph of the acyclic chromatic number 6 is constructed. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2019.111623 | Discrete Mathematics |
Keywords | Field | DocType |
IC-planar graph,1-planar graph,Acyclic coloring,Acyclic chromatic number | Discrete mathematics,Graph,Combinatorics,Chromatic scale,Vertex (geometry),Planar graph,Mathematics,Acyclic coloring | Journal |
Volume | Issue | ISSN |
342 | 12 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wanshun Yang | 1 | 0 | 0.68 |
| Weifan Wang | 2 | 868 | 89.92 |
| Yiqiao Wang | 3 | 0 | 0.34 |