Abstract
The crossing number of a graph is the minimum number of pairwise intersections of edges among all drawings of . In this paper, we study the crossing number of , , and .
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.