1 paper
Zongpeng Ding, Yuanqiu Huang, Fengming Dong
A graph G is said to be crossing-critical if cr(G−e)<cr(G) for every edge e of G, where cr(G) is the crossing number of G. Richter and Thomassen [Journal of Combinator…