default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhangdong Ouyang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j22]Jing Wang
, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang:
The generalized 4-connectivity of burnt pancake graphs. Discret. Appl. Math. 360: 93-114 (2025)- 2022
- [j21]Fengming Dong, Jun Ge, Zhangdong Ouyang:
Express the number of spanning trees in term of degrees. Appl. Math. Comput. 415: 126697 (2022) - [j20]Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong:
New upper bounds for the crossing numbers of crossing-critical graphs. Discret. Math. 345(12): 113090 (2022) - [j19]Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong:
On the Size of Matchings in 1-Planar Graph with High Minimum Degree. SIAM J. Discret. Math. 36(4): 2570-2584 (2022) - 2021
- [j18]Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong:
On the Sizes of Bipartite 1-Planar Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j17]Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong:
The Maximal 1-Planarity and Crossing Numbers of Graphs. Graphs Comb. 37(4): 1333-1344 (2021) - [j16]Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay:
Zip product of graphs and crossing numbers. J. Graph Theory 96(2): 289-309 (2021) - [j15]Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay:
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. J. Graph Theory 96(3): 343-360 (2021)
2010 – 2019
- 2019
- [j14]Zhangdong Ouyang, Jun Ge, Yichao Chen:
Remarks on the joins of 1-planar graphs. Appl. Math. Comput. 362 (2019) - [j13]Zhangdong Ouyang, Fengming Dong, Eng Guan Tay:
On the skewness of Cartesian products with trees. Discret. Appl. Math. 267: 131-141 (2019) - [j12]Yuanqiu Huang, Zhangdong Ouyang, Jing Wang:
The crossing number of the hexagonal graph H3, n. Discuss. Math. Graph Theory 39(2): 547-554 (2019) - 2018
- [j11]Zhimin Liu, Zhangdong Ouyang:
k -Coverage Estimation Problem in Heterogeneous Camera Sensor Networks With Boundary Deployment. IEEE Access 6: 2825-2833 (2018) - [j10]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The Strong Product of Graphs and Crossing Numbers. Ars Comb. 137: 141-147 (2018) - [j9]Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang:
The crossing numbers of Cartesian products of path with some graphs. Ars Comb. 141: 101-110 (2018) - [j8]Yuanqiu Huang, Zhangdong Ouyang, Jing Wang:
The crossing number of join of the generalized Petersen graph P(3, 1) with path and cycle. Discuss. Math. Graph Theory 38(2): 351-370 (2018) - 2017
- [j7]Zhimin Liu, Zhangdong Ouyang:
A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks. KSII Trans. Internet Inf. Syst. 11(10): 4807-4822 (2017) - 2016
- [j6]Ting Guo, Yuanqiu Huang, Zhangdong Ouyang:
Total Embedding distributions for two graph families obtained from the dipole D3. Ars Comb. 126: 165-176 (2016) - 2015
- [j5]Yahui Hu, Yaoping Hou, Zhangdong Ouyang:
The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth. Ars Comb. 118: 293-304 (2015) - 2014
- [j4]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The crossing number of the Cartesian product of paths with complete graphs. Discret. Math. 328: 71-78 (2014) - 2013
- [j3]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability. Ars Comb. 109: 473-483 (2013) - 2010
- [j2]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
On the lower bounds for the maximum genus for simple graphs. Eur. J. Comb. 31(5): 1235-1242 (2010)
2000 – 2009
- 2009
- [j1]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices. Graphs Comb. 25(2): 253-264 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
