Zongpeng Ding

collaborators

2 papers

math.CO2024

A new infinite family of 4-regular crossing-critical graphs

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…

math.CO2020

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

Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang +1

A graph $G$ is { $k$ -crossing-critical} if $cr (G) \geq k$ , but $cr (G ∖ e) < k$ for each edge $e \in E (G)$ , where $cr (G)$ is the crossing number of $G$ . It is known that for any $k…