2022/08/25 by Otfried Cheong, Cheong, Otfried, Maximilian Pfister +3
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2208.12324
openalex publication_date 2022/08/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.