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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.