The crossing numbers of K_m× P_n and K_m× C_n

2012/11/20 by Yang, Yuansheng, Zheng, Baigong, Xu, Xirong +1
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1211.4641

Abstract

The \it crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. In this paper, we study the crossing numbers of K_m× P_n and K_m× C_n.

Related

• The crossing numbers of K_n,n-nK₂, K_n× P₂, K_n× P₃ and K_n× C₄
• A slightly better bound on the crossing number in terms of the pair-crossing number
• Improvement on the crossing number of crossing-critical graphs
• Generalizations of the Crossing Lemma
• Using Block Designs in Crossing Number Bounds