default search action
Yuanqiu Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j39]Jing Wang
, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang:
The generalized 4-connectivity of burnt pancake graphs. Discret. Appl. Math. 360: 93-114 (2025) - 2024
- [j38]Yuanqiu Huang, Licheng Zhang
A new note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 348: 165-183 (2024) - [j37]Licheng Zhang, Yuanqiu Huang:
On the sizes of generalized cactus graphs. Discret. Appl. Math. 348: 184-191 (2024) - [j36]Yuanqiu Huang, Licheng Zhang, Yuxi Wang
The matching extendability of 7-connected maximal 1-plane graphs. Discuss. Math. Graph Theory 44(2): 777 (2024) - 2023
- [j35]Jing Wang, Zuozheng Zhang, Yuanqiu Huang:
The generalized 3-connectivity of burnt pancake graphs and godan graphs. AKCE Int. J. Graphs Comb. 20(1): 98-103 (2023) - [j34]Zongpeng Ding, Yuanqiu Huang, Licheng Zhang:
Maximal 1-plane graphs with dominating vertices. Appl. Math. Comput. 457: 128206 (2023) - 2022
- [j33]Zongpeng Ding, Zhangdong Ouyang
New upper bounds for the crossing numbers of crossing-critical graphs. Discret. Math. 345(12): 113090 (2022) - [j32]Jing Wang, Junliang Cai, Shengxiang Lv, Yuanqiu Huang:
The crossing number of hexagonal graph H3, n in the projective plane. Discuss. Math. Graph Theory 42(1): 197-218 (2022) - [j31]Yuanqiu Huang, Zhangdong Ouyang
On the Size of Matchings in 1-Planar Graph with High Minimum Degree. SIAM J. Discret. Math. 36(4): 2570-2584 (2022) - 2021
- [j30]Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
On the Sizes of Bipartite 1-Planar Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j29]Yuanqiu Huang, Yuxi Wang:
The crossing number of Cartesian product of 5-wheels with any tree. Discuss. Math. Graph Theory 41(1): 183-197 (2021) - [j28]Zhangdong Ouyang
The Maximal 1-Planarity and Crossing Numbers of Graphs. Graphs Comb. 37(4): 1333-1344 (2021) - [j27]Zongpeng Ding, Yuanqiu Huang:
A Note on the Crossing Number of the Cone of a Graph. Graphs Comb. 37(6): 2351-2363 (2021) - [j26]Zhangdong Ouyang
Zip product of graphs and crossing numbers. J. Graph Theory 96(2): 289-309 (2021) - 2020
- [j25]Yuanqiu Huang, Tinglei Zhao, Zongpeng Ding:
Graphs whose crossing numbers are the same as those of their line graphs. Australas. J Comb. 77: 224-248 (2020) - [j24]Yuanqiu Huang, Yuxi Wang:
The crossing number of K5, n+1∖e. Appl. Math. Comput. 376: 125075 (2020)
2010 – 2019
- 2019
- [j23]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
- [j22]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The Strong Product of Graphs and Crossing Numbers. Ars Comb. 137: 141-147 (2018) - [j21]Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang:
The crossing numbers of Cartesian products of path with some graphs. Ars Comb. 141: 101-110 (2018) - [j20]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) - [j19]Zongpeng Ding, Yuanqiu Huang:
The crossing numbers of join of some graphs with n isolated vertices. Discuss. Math. Graph Theory 38(4): 899-909 (2018) - 2017
- [j18]Zhidong Zhou, Yuanqiu Huang, Jing Wang:
On the Crossing Numbers of the Joint Graphs of a Path or a Cycle. Ars Comb. 130: 357-371 (2017) - 2016
- [j17]Ting Guo, Yuanqiu Huang, Zhangdong Ouyang:
Total Embedding distributions for two graph families obtained from the dipole D3. Ars Comb. 126: 165-176 (2016) - 2014
- [j16]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
- [j15]Guanghua Dong, Han Ren, Ning Wang, Yuanqiu Huang:
Lower bound on the number of the maximum genus embedding of Kn, n. Ars Comb. 108: 155-159 (2013) - [j14]Jing Wang, Lixi Zhang, Yuanqiu Huang:
On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with Sn. Ars Comb. 109: 257-266 (2013) - [j13]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability. Ars Comb. 109: 473-483 (2013) - 2012
- [i1]Guanghua Dong, Ning Wang, Yuanqiu Huang, Han Ren, Yanpei Liu:
Vertex Splitting and Upper Embeddable Graphs. CoRR abs/1203.0840 (2012) - 2011
- [j12]Jing Wang, Zihan Yuan, Yuanqiu Huang:
On the Crossing Number of the Generalized Petersen Graph P(3k, k). Ars Comb. 100: 395-407 (2011) - 2010
- [j11]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
- [j10]Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices. Graphs Comb. 25(2): 253-264 (2009) - 2008
- [j9]Yuanqiu Huang, Tinglei Zhao:
The crossing number of K1, 4, n. Discret. Math. 308(9): 1634-1638 (2008) - [j8]Zihan Yuan, Ling Tang, Yuanqiu Huang, Jinwang Liu:
The Crossing Number of C (8, 2) P n . Graphs Comb. 24(6): 597-604 (2008) - 2007
- [j7]Yuanqiu Huang, Yuming Chu:
A note on the computational complexity of graph vertex partition. Discret. Appl. Math. 155(3): 405-409 (2007) - [j6]Ling Tang, Shengxiang Lv, Yuanqiu Huang:
The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n . Graphs Comb. 23(6): 659-666 (2007) - 2005
- [j5]Yuanqiu Huang, Tinglei Zhao:
Maximum genus, connectivity and minimal degree of graphs. Discret. Math. 300(1-3): 110-119 (2005) - 2003
- [j4]Yuanqiu Huang:
Maximum genus of a graph in terms of its embedding properties. Discret. Math. 262(1-3): 171-180 (2003) - [j3]Yuanqiu Huang:
Maximum genus and chromatic number of graphs. Discret. Math. 271(1-3): 117-127 (2003) - 2000
- [j2]Yuanqiu Huang, Yanpei Liu:
Face Size and the Maximum Genus of a Graph 1. Simple Graphs. J. Comb. Theory B 80(2): 356-370 (2000)
1990 – 1999
- 1999
- [j1]Yuanqiu Huang, Yanpei Liu:
The maximum genus of graphs with diameter three. Discret. Math. 194(1-3): 139-149 (1999)
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 21:13 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: