The crossing numbers of K_n,n-nK₂, K_n× P₂, K_n× P₃ and K_n× C₄

2012/11/19 by Yuansheng Yang, Yang, Yuansheng, Baigong Zheng +5
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1211.4437

openalex publication_date 2012/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 K_n,n-nK₂, K_n× P₂, K_n× P₃ and K_n× C₄.

Related

• The crossing numbers of K_m× P_n and K_m× C_n
• Improvement on the crossing number of crossing-critical graphs
• Using Block Designs in Crossing Number Bounds
• A slightly better bound on the crossing number in terms of the pair-crossing number
• The crossing number of the generalized Petersen graph P(10, 3) is six