New upper bounds for the crossing numbers of crossing-critical graphs

2020/03/14 by Zongpeng Ding, Zhangdong Ouyang, Ding, Zongpeng +5
Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2003.06579

Abstract

A graph G is k-crossing-critical if cr(G)≥ k, but cr(G∖ e)

Related

• Improvement on the crossing number of crossing-critical graphs
• A new infinite family of 4-regular crossing-critical graphs
• Making a graph crossing-critical by multiplying its edges
• Unexpected behaviour of crossing sequences
• A slightly better bound on the crossing number in terms of the pair-crossing number