Yuanqiu Huang

Orcid: 0000-0002-6081-6293

According to our database1, Yuanqiu Huang authored at least 40 papers between 1999 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The generalized 4-connectivity of burnt pancake graphs.
Discret. Appl. Math., 2025

2024
The matching extendability of 7-connected maximal 1-plane graphs.
Discuss. Math. Graph Theory, 2024

On the sizes of generalized cactus graphs.
Discret. Appl. Math., 2024

A new note on 1-planar graphs with minimum degree 7.
Discret. Appl. Math., 2024

2023
Maximal 1-plane graphs with dominating vertices.
Appl. Math. Comput., November, 2023

The generalized 3-connectivity of burnt pancake graphs and godan graphs.
AKCE Int. J. Graphs Comb., January, 2023

2022
On the Size of Matchings in 1-Planar Graph with High Minimum Degree.
SIAM J. Discret. Math., December, 2022

The crossing number of hexagonal graph H<sub>3, n</sub> in the projective plane.
Discuss. Math. Graph Theory, 2022

New upper bounds for the crossing numbers of crossing-critical graphs.
Discret. Math., 2022

2021
Zip product of graphs and crossing numbers.
J. Graph Theory, 2021

The Maximal 1-Planarity and Crossing Numbers of Graphs.
Graphs Comb., 2021

A Note on the Crossing Number of the Cone of a Graph.
Graphs Comb., 2021

The crossing number of Cartesian product of 5-wheels with any tree.
Discuss. Math. Graph Theory, 2021

On the Sizes of Bipartite 1-Planar Graphs.
Electron. J. Comb., 2021

2020
The crossing number of K5, n+1∖e.
Appl. Math. Comput., 2020

Graphs whose crossing numbers are the same as those of their line graphs.
Australas. J Comb., 2020

2019
The crossing number of the hexagonal graph <i>H<sub>3, n</sub></i>.
Discuss. Math. Graph Theory, 2019

2018
The crossing number of join of the generalized Petersen graph <i>P</i>(3, 1) with path and cycle.
Discuss. Math. Graph Theory, 2018

The crossing numbers of join of some graphs with <i>n</i> isolated vertices.
Discuss. Math. Graph Theory, 2018

The Strong Product of Graphs and Crossing Numbers.
Ars Comb., 2018

The crossing numbers of Cartesian products of path with some graphs.
Ars Comb., 2018

2017
On the Crossing Numbers of the Joint Graphs of a Path or a Cycle.
Ars Comb., 2017

2016
Total Embedding distributions for two graph families obtained from the dipole D<sub>3</sub>.
Ars Comb., 2016

2014
The crossing number of the Cartesian product of paths with complete graphs.
Discret. Math., 2014

2013
On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with S<sub>n</sub>.
Ars Comb., 2013

The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.
Ars Comb., 2013

Lower bound on the number of the maximum genus embedding of K<sub>n, n</sub>.
Ars Comb., 2013

2012
Vertex Splitting and Upper Embeddable Graphs
CoRR, 2012

2011
On the Crossing Number of the Generalized Petersen Graph P(3k, k).
Ars Comb., 2011

2010
On the lower bounds for the maximum genus for simple graphs.
Eur. J. Comb., 2010

2009
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.
Graphs Comb., 2009

2008
The Crossing Number of <i>C</i> (8, 2) <i>P</i> <sub> <i>n</i> </sub>.
Graphs Comb., 2008

The crossing number of K<sub>1, 4, n</sub>.
Discret. Math., 2008

2007
The Crossing Number of Cartesian Products of Complete Bipartite Graphs <i>K</i> <sub>2, <i>m</i> </sub> with Paths <i>P</i> <sub> <i>n</i> </sub>.
Graphs Comb., 2007

A note on the computational complexity of graph vertex partition.
Discret. Appl. Math., 2007

2005
Maximum genus, connectivity and minimal degree of graphs.
Discret. Math., 2005

2003
Maximum genus of a graph in terms of its embedding properties.
Discret. Math., 2003

Maximum genus and chromatic number of graphs.
Discret. Math., 2003

2000
Face Size and the Maximum Genus of a Graph 1. Simple Graphs.
J. Comb. Theory B, 2000

1999
The maximum genus of graphs with diameter three.
Discret. Math., 1999


  Loading...