The thickness of fan-planar graphs is at most three
Otfried Cheong, Maximilian Pfister, Lena Schlipf · arXiv (Cornell University) · 2022
We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most three. If G is bipartite, then two colors suffice to color the edges in this way.