IC-Planar Graphs Are 6-Choosable
Wanshun Yang, Yiqiao Wang, Weifan Wang, Ko‐Wei Lih · SIAM Journal on Discrete Mathematics · 2021
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.