The thickness of fan-planar graphs is at most three
arXiv:2208.12324
Abstract
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.
Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)