Zhangdong Ouyang

From MaRDI portal
Person:1708381

Available identifiers

zbMath Open ouyang.zhangdongMaRDI QIDQ1708381

List of research outcomes





PublicationDate of PublicationType
The generalized 4-connectivity of burnt pancake graphs2024-12-04Paper
The generalized 4-connectivity of burnt pancake graphs2023-10-01Paper
Zip product of graphs and crossing numbers2023-09-29Paper
On the Size of Matchings in 1-Planar Graph with High Minimum Degree2022-11-09Paper
New upper bounds for the crossing numbers of crossing-critical graphs2022-09-26Paper
https://portal.mardi4nfdi.de/entity/Q50905292022-07-20Paper
<italic>K</italic><sub>1,1,<italic>m</italic></sub>□<italic>P</italic><sub><italic>n</italic></sub> 的交叉数2021-12-17Paper
The maximal 1-planarity and crossing numbers of graphs2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49952992021-06-23Paper
Express the number of spanning trees in term of degrees2021-06-15Paper
On the sizes of bipartite 1-planar graphs2021-06-07Paper
Properties of \(\pi\)-skew graphs with applications2021-05-11Paper
https://portal.mardi4nfdi.de/entity/Q49838322021-04-26Paper
A note on the crossing numbers of 5-regular graphs2020-08-26Paper
On the skewness of Cartesian products with trees2019-09-05Paper
The crossing number of the hexagonal graph \(H_{3,n}\)2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q45586482018-11-29Paper
https://portal.mardi4nfdi.de/entity/Q45681602018-06-15Paper
https://portal.mardi4nfdi.de/entity/Q46428972018-05-25Paper
The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle2018-03-23Paper
Two recursive inequalities for crossing numbers of graphs2017-06-14Paper
Total embedding distributions for two graph families obtained from the dipole \(D_3\).2016-10-26Paper
The crossing number of \(K_m^-\square P_n\)2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29921362016-08-10Paper
The second-minimum Gutman index of the unicyclic graphs with given girth.2016-05-04Paper
https://portal.mardi4nfdi.de/entity/Q54994412015-02-11Paper
The crossing number of the Cartesian product of paths with complete graphs2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q53972942014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q31097292012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q30718392011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q35724462010-07-08Paper
On the lower bounds for the maximum genus for simple graphs2010-06-17Paper
https://portal.mardi4nfdi.de/entity/Q34038152010-02-12Paper
Upper embeddability, edge independence number and girth2009-12-11Paper
Upper embeddability, girth and the degree-sum of nonadjacent vertices2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q36415772009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36417652009-11-11Paper
Upper embeddable graphs with respect to diameter2009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q53185022009-07-22Paper
Classes of upper-embeddable graphs in terms of dominate vertices set2008-08-06Paper
Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices2008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54556462008-04-04Paper

Research outcomes over time

This page was built for person: Zhangdong Ouyang