| Publication | Date of Publication | Type |
|---|
The generalized 4-connectivity of burnt pancake graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane
AKCE International Journal of Graphs and Combinatorics | 2024-03-12 | Paper |
The generalized 4-connectivity of burnt pancake graphs
| 2023-10-01 | Paper |
The generalized 3-connectivity of burnt pancake graphs and godan graphs
AKCE International Journal of Graphs and Combinatorics | 2023-08-02 | Paper |
The generalized 3-connectivity of a family reguar networks
| 2022-11-01 | Paper |
scientific article; zbMATH DE number 7492513 (Why is no real title available?)
| 2022-03-17 | Paper |
The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
<italic>K</italic><sub>1,1,<italic>m</italic></sub>□<italic>P</italic><sub><italic>n</italic></sub> 的交叉数
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7380538 (Why is no real title available?)
| 2021-08-10 | Paper |
On the existence of \(F\)-strong trace of a graph when \(F\) induces a forest
| 2021-08-10 | Paper |
On the Cartesian products with crossing number three
| 2021-06-23 | Paper |
The Cartesian product graphs with crossing number two when a factor is a path
| 2021-04-26 | Paper |
Nonplanarity of iterated line graphs
Journal of Mathematics | 2021-02-16 | Paper |
On the join graphs with crossing number two
| 2020-01-22 | Paper |
The crossing number of the hexagonal graph \(H_{3,n}\)
Discussiones Mathematicae Graph Theory | 2019-02-07 | Paper |
The strong product of graphs and crossing numbers.
| 2018-06-15 | Paper |
On the join graphs with crossing number one
| 2018-05-25 | Paper |
The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
Discussiones Mathematicae Graph Theory | 2018-03-23 | Paper |
On the crossing numbers of the joint graphs of a path or a cycle.
| 2017-09-06 | Paper |
Two recursive inequalities for crossing numbers of graphs
Frontiers of Mathematics in China | 2017-06-14 | Paper |
The crossing number of the Cartesian product of paths with complete graphs
Discrete Mathematics | 2014-05-06 | Paper |
On the crossing numbers of \(W_6\times S_n\)
| 2014-02-28 | Paper |
The degree-sum of adjacent vertices, girth and upper embeddability
| 2014-02-19 | Paper |
On the crossing number of the Cartesian product of a 6-vertex graph with \(S_n\)
| 2014-02-19 | Paper |
Counting embeddings of circular graph \(C(2n,2)(n>2)\) on the projective plane
| 2013-06-20 | Paper |
The crossing number of the generalized Petersen graph \(P [3k - 1,k\)]
| 2013-04-03 | Paper |
On the crossing number of the generalized Petersen graph \(P(3k,k)\).
| 2012-10-12 | Paper |
scientific article; zbMATH DE number 6002232 (Why is no real title available?)
| 2012-01-27 | Paper |
Survey of the crossing number of graphs
| 2011-07-19 | Paper |
Embeddings of circular graph \(C(2n+1,2)\) \((n>2)\) on the projective plane
| 2011-03-09 | Paper |
The embedding numbers of circular multi-ladders on the projective plane
| 2011-02-05 | Paper |
The crossing number of the circulant graph \(C(3k-1;\{1,k\})\)
| 2011-01-10 | Paper |
The crossing number of Cartesian product of \(P_n\) with circulant graph \(C(10,2)\)
| 2010-11-05 | Paper |
scientific article; zbMATH DE number 5735163 (Why is no real title available?)
| 2010-07-09 | Paper |
scientific article; zbMATH DE number 5732461 (Why is no real title available?)
| 2010-07-08 | Paper |
On the lower bounds for the maximum genus for simple graphs
European Journal of Combinatorics | 2010-06-17 | Paper |
Upper embeddability, girth and the degree-sum of nonadjacent vertices
Graphs and Combinatorics | 2009-12-09 | Paper |
Crossing number of the complete tripartite graph \(K_{1,10,n}\)
| 2009-07-22 | Paper |
scientific article; zbMATH DE number 5524042 (Why is no real title available?)
| 2009-03-06 | Paper |
scientific article; zbMATH DE number 5257393 (Why is no real title available?)
| 2008-04-03 | Paper |
