Ding Zongpeng

Prof. Dr. Ding Zongpeng


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2020 in Bulletin of the Malaysian Mathematical Sciences Society
Verified
Journal Article
Closed access
PDF file
DZDing Zongpeng
Ding Zongpeng

25 July 2022 in Discrete Mathematics
Verified
Journal Article
Closed access
DZDing Zongpeng
Ding Zongpeng
ZOZhangdong Ouyang
Zhangdong Ouyang
YHYuanqiu Huang
Yuanqiu Huang
FDFengming Dong
Fengming Dong

26 June 2021 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
DZDing Zongpeng
Ding Zongpeng
YHYuanqiu Huang
Yuanqiu Huang

1 January 2023 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
DZDing Zongpeng
Ding Zongpeng
The skewness of a graph $ G $, $ sk(G) $, is the smallest number of edges that need to be removed from $ G $ to make it planar. The crossing number of a graph $ G $, $ cr(G) $, is the minimum number of crossings over all possible drawings of $ G $. There is minimal work concerning the relationship between skewness and crossing numbers. In this work, we first introduce an inequality relation for these two parameters, and then we construct infinitely many near-planar graphs such that the inequality is equal. In addition, we give a necessary and sufficient condition for a graph to have its skewness equal to the crossing number and characterize some special graphs with $ sk(G) = cr(G) $.

15 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
DZDing Zongpeng
Ding Zongpeng
YHYuanqiu Huang
Yuanqiu Huang
FDFengming Dong
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 Combinatorial Theory, Series B 58 (1993), 217-224] constructed an infinite family of 4-regular crossing-critical graphs with crossing number $3$. In this article, we present a new infinite family of 4-regular crossing-critical graphs.

7 July 2023 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
DZDing Zongpeng
Ding Zongpeng
YHYuanqiu Huang
Yuanqiu Huang
LZLicheng Zhang
Licheng Zhang