ZDZongpeng Ding
Zongpeng Ding
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zongpeng Ding has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Yuanqiu Huang
Department of Mathematics Hunan Normal University 410081 Changsha P.R.China
5 shared publications - Fengming Dong
National Institute of Education, Nanyang Technological University, Singapore, Singapore
3 shared publications - Zhangdong Ouyang
Department of Mathematics Hunan First Normal University 410205 Changsha P.R.China
2 shared publications - Licheng Zhang
School of Mathematics Hunan University 410082 Changsha P.R.China
1 shared publication
Latest Publications
- Open Access
A new infinite family of 4-regular crossing-critical graphs
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.Open AccessA new infinite family of 4-regular crossing-critical graphs
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
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 457
Maximal 1-plane graphs with dominating vertices
- 7 July 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 457
Maximal 1-plane graphs with dominating vertices
- Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (10) , 23989-23996
Skewness and the crossing numbers of graphs
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) $.- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (10) , 23989-23996
Open AccessSkewness and the crossing numbers of graphs
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) $. - 25 July 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (12)
New upper bounds for the crossing numbers of crossing-critical graphs
- 25 July 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (12)
New upper bounds for the crossing numbers of crossing-critical graphs
- 26 June 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2351-2363
A Note on the Crossing Number of the Cone of a Graph
- 26 June 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2351-2363
A Note on the Crossing Number of the Cone of a Graph
- Open Access
New upper bounds for the crossing numbers of crossing-critical graphs
A graph $G$ is {$k$-crossing-critical} if $cr(G)\ge k$, but $cr(G\setminus 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$-crossing-critical graph $G$, $cr(G)\le 2.5k+16$ holds, and in particular, if $\delta(G)\ge 4$, then $cr(G)\le 2k+35$ holds, where $\delta(G)$ is the minimum degree of $G$. In this paper, we improve these upper bounds to $2.5k +2.5$ and $2k+8$ respectively. In particular, for any $k$-crossing-critical graph $G$ with $n$ vertices, if $\delta(G)\ge 5$, then $cr(G)\le 2k-\sqrt k/2n+35/6$ holds.Open AccessNew upper bounds for the crossing numbers of crossing-critical graphs
A graph $G$ is {$k$-crossing-critical} if $cr(G)\ge k$, but $cr(G\setminus 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$-crossing-critical graph $G$, $cr(G)\le 2.5k+16$ holds, and in particular, if $\delta(G)\ge 4$, then $cr(G)\le 2k+35$ holds, where $\delta(G)$ is the minimum degree of $G$. In this paper, we improve these upper bounds to $2.5k +2.5$ and $2k+8$ respectively. In particular, for any $k$-crossing-critical graph $G$ with $n$ vertices, if $\delta(G)\ge 5$, then $cr(G)\le 2k-\sqrt k/2n+35/6$ holds. - 26 February 2020
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (6) , 4183-4196
Rotation and Crossing Numbers for Join Products
- 26 February 2020
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 43 (6) , 4183-4196
Rotation and Crossing Numbers for Join Products