The crossing numbers of Kn,n-nK2, Kn× P2, Kn× P3 and Kn× C4
Abstract
The crossing number of a graph G is the minimum number of pairwise intersections of edges among all drawings of G. In this paper, we study the crossing number of Kn,n-nK2, Kn× P2, Kn× P3 and Kn× C4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.