Yuanqiu Huang

43 papers Journal 43
YearRankTypeTitle / Venue / Authors
2025 J jnl
4-Connected 1-Planar Chordal Graphs Are Hamiltonian-Connected.
J. Graph Theory
Licheng Zhang, Yuanqiu Huang, Shengxiang Lv, Fengming Dong
2025 J jnl
Reliability analysis of godan graphs in terms of generalized 4-connectivity.
Discret. Appl. Math.
Jing Wang, Zhangdong Ouyang, Yuanqiu Huang
2025 J jnl
The Generalized 3-Connectivity of a Family of Regular Networks.
Int. J. Found. Comput. Sci.
Jing Wang, Xidao Luan, Yuanqiu Huang
2025 J jnl
The generalized 4-connectivity of burnt pancake graphs.
Discret. Appl. Math.
Jing Wang, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang
2024 J jnl
A new note on 1-planar graphs with minimum degree 7.
Discret. Appl. Math.
Yuanqiu Huang, Licheng Zhang, Fengming Dong
2024 J jnl
On the sizes of generalized cactus graphs.
Discret. Appl. Math.
Licheng Zhang, Yuanqiu Huang
2024 J jnl
The matching extendability of 7-connected maximal 1-plane graphs.
Discuss. Math. Graph Theory
Yuanqiu Huang, Licheng Zhang, Yuxi Wang
2023 J jnl
Maximal 1-plane graphs with dominating vertices.
Appl. Math. Comput.
Zongpeng Ding, Yuanqiu Huang, Licheng Zhang
2023 J jnl
The generalized 3-connectivity of burnt pancake graphs and godan graphs.
AKCE Int. J. Graphs Comb.
Jing Wang, Zuozheng Zhang, Yuanqiu Huang
2022 J jnl
New upper bounds for the crossing numbers of crossing-critical graphs.
Discret. Math.
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2022 J jnl
On the Size of Matchings in 1-Planar Graph with High Minimum Degree.
SIAM J. Discret. Math.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2022 J jnl
The crossing number of hexagonal graph H
Discuss. Math. Graph Theory
Jing Wang, Junliang Cai, Shengxiang Lv, Yuanqiu Huang
2021 J jnl
A Note on the Crossing Number of the Cone of a Graph.
Graphs Comb.
Zongpeng Ding, Yuanqiu Huang
2021 J jnl
On the Sizes of Bipartite 1-Planar Graphs.
Electron. J. Comb.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2021 J jnl
The Maximal 1-Planarity and Crossing Numbers of Graphs.
Graphs Comb.
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2021 J jnl
The crossing number of Cartesian product of 5-wheels with any tree.
Discuss. Math. Graph Theory
Yuanqiu Huang, Yuxi Wang
2021 J jnl
Zip product of graphs and crossing numbers.
J. Graph Theory
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay
2020 J jnl
Graphs whose crossing numbers are the same as those of their line graphs.
Australas. J Comb.
Yuanqiu Huang, Tinglei Zhao, Zongpeng Ding
2020 J jnl
The crossing number of K5, n+1∖e.
Appl. Math. Comput.
Yuanqiu Huang, Yuxi Wang
2019 J jnl
The crossing number of the hexagonal graph
Discuss. Math. Graph Theory
Yuanqiu Huang, Zhangdong Ouyang, Jing Wang
2018 J jnl
The Strong Product of Graphs and Crossing Numbers.
Ars Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2018 J jnl
The crossing number of join of the generalized Petersen graph
Discuss. Math. Graph Theory
Yuanqiu Huang, Zhangdong Ouyang, Jing Wang
2018 J jnl
The crossing numbers of Cartesian products of path with some graphs.
Ars Comb.
Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang
2018 J jnl
The crossing numbers of join of some graphs with
Discuss. Math. Graph Theory
Zongpeng Ding, Yuanqiu Huang
2017 J jnl
On the Crossing Numbers of the Joint Graphs of a Path or a Cycle.
Ars Comb.
Zhidong Zhou, Yuanqiu Huang, Jing Wang
2016 J jnl
Total Embedding distributions for two graph families obtained from the dipole D
Ars Comb.
Ting Guo, Yuanqiu Huang, Zhangdong Ouyang
2014 J jnl
The crossing number of the Cartesian product of paths with complete graphs.
Discret. Math.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2013 J jnl
Lower bound on the number of the maximum genus embedding of K
Ars Comb.
Guanghua Dong, Han Ren, Ning Wang, Yuanqiu Huang
2013 J jnl
On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with S
Ars Comb.
Jing Wang, Lixi Zhang, Yuanqiu Huang
2013 J jnl
The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.
Ars Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2012 J jnl
Vertex Splitting and Upper Embeddable Graphs
CoRR
Guanghua Dong, Ning Wang, Yuanqiu Huang, Han Ren, Yanpei Liu
2011 J jnl
On the Crossing Number of the Generalized Petersen Graph P(3k, k).
Ars Comb.
Jing Wang, Zihan Yuan, Yuanqiu Huang
2010 J jnl
On the lower bounds for the maximum genus for simple graphs.
Eur. J. Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2009 J jnl
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.
Graphs Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2008 J jnl
The Crossing Number of
Graphs Comb.
Zihan Yuan, Ling Tang, Yuanqiu Huang, Jinwang Liu
2008 J jnl
The crossing number of K
Discret. Math.
Yuanqiu Huang, Tinglei Zhao
2007 J jnl
A note on the computational complexity of graph vertex partition.
Discret. Appl. Math.
Yuanqiu Huang, Yuming Chu
2007 J jnl
The Crossing Number of Cartesian Products of Complete Bipartite Graphs
Graphs Comb.
Ling Tang, Shengxiang Lv, Yuanqiu Huang
2005 J jnl
Maximum genus, connectivity and minimal degree of graphs.
Discret. Math.
Yuanqiu Huang, Tinglei Zhao
2003 J jnl
Maximum genus and chromatic number of graphs.
Discret. Math.
Yuanqiu Huang
2003 J jnl
Maximum genus of a graph in terms of its embedding properties.
Discret. Math.
Yuanqiu Huang
2000 J jnl
Face Size and the Maximum Genus of a Graph 1. Simple Graphs.
J. Comb. Theory B
Yuanqiu Huang, Yanpei Liu
1999 J jnl
The maximum genus of graphs with diameter three.
Discret. Math.
Yuanqiu Huang, Yanpei Liu