Acyclic coloring of IC-planar graphs

doi:10.1016/j.disc.2019.111623

Discrete Mathematics

Volume 342, Issue 12, December 2019, 111623

https://doi.org/10.1016/j.disc.2019.111623 Get rights and content

Under an Elsevier user license

open archive

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.

Keywords

IC-planar graph

1-planar graph

Acyclic coloring

Acyclic chromatic number

Cited by (0)

¹: Research supported by National Natural Science Foundation of China (No.11771402).

²: Research supported by National Natural Science Foundation of China (No.11671053).