Yuanqiu Huang

From MaRDI portal
Person:1708382

Available identifiers

zbMath Open huang.yuanqiuMaRDI QIDQ1708382

List of research outcomes





PublicationDate of PublicationType
The generalized 4-connectivity of burnt pancake graphs2024-12-04Paper
A new note on 1-planar graphs with minimum degree 72024-03-27Paper
On the sizes of generalized cactus graphs2024-03-27Paper
On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs2023-11-20Paper
The generalized 4-connectivity of burnt pancake graphs2023-10-01Paper
Zip product of graphs and crossing numbers2023-09-29Paper
Maximal 1-plane graphs with dominating vertices2023-09-11Paper
The generalized 3-connectivity of burnt pancake graphs and godan graphs2023-08-02Paper
https://portal.mardi4nfdi.de/entity/Q58749932023-02-09Paper
The reducibility of optimal 1-planar graphs with respect to the lexicographic product2022-11-27Paper
On the Size of Matchings in 1-Planar Graph with High Minimum Degree2022-11-09Paper
The generalized 3-connectivity of a family reguar networks2022-11-01Paper
New upper bounds for the crossing numbers of crossing-critical graphs2022-09-26Paper
https://portal.mardi4nfdi.de/entity/Q50628512022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50627212022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50629302022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50631662022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50631722022-03-17Paper
The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane2022-01-03Paper
https://portal.mardi4nfdi.de/entity/Q33850842021-12-17Paper
<italic>K</italic><sub>1,1,<italic>m</italic></sub>□<italic>P</italic><sub><italic>n</italic></sub> 的交叉数2021-12-17Paper
A note on the upper embeddability of graphs2021-12-17Paper
A note on the crossing number of the cone of a graph2021-11-30Paper
The maximal 1-planarity and crossing numbers of graphs2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49981422021-07-01Paper
https://portal.mardi4nfdi.de/entity/Q49952992021-06-23Paper
On the sizes of bipartite 1-planar graphs2021-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49838322021-04-26Paper
The crossing number of Cartesian product of 5-wheel with any tree2020-12-08Paper
https://portal.mardi4nfdi.de/entity/Q33007002020-07-29Paper
The crossing number of \(K_{5,n+1} \setminus e\)2020-05-06Paper
https://portal.mardi4nfdi.de/entity/Q52091402020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52063882019-12-18Paper
The crossing number of the hexagonal graph \(H_{3,n}\)2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q45586482018-11-29Paper
The crossing numbers of join of some graphs with \(n\) isolated vertices2018-08-10Paper
https://portal.mardi4nfdi.de/entity/Q31760642018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45681602018-06-15Paper
https://portal.mardi4nfdi.de/entity/Q46428972018-05-25Paper
Enumerating Unlabelled Embeddings of Digraphs2018-04-06Paper
The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle2018-03-23Paper
https://portal.mardi4nfdi.de/entity/Q53550562017-09-06Paper
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
Genus distribution of \(D_3\square P_n\)2016-10-06Paper
The crossing number of \(K_m^-\square P_n\)2016-10-06Paper
Genus distribution of graph self-amalgamations2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29921362016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q29920972016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q34611862016-01-15Paper
The crossing number of join products of a special 5-vertex graph with \(C_n\)2015-10-28Paper
Embedding on torus of a one type of graph2015-10-28Paper
Vertex splitting and upper embeddable graphs2015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q54982632015-02-11Paper
On the crossing number of products of \(K_{3,3}\) with \(S_n^*\)2015-02-11Paper
The crossing number of the Cartesian product of paths with complete graphs2014-05-06Paper
The crossing number of the joint graph of a small graph and a path or a cycle2014-02-28Paper
Genus distribution of graphs under surgery: adding edges and deleting edges2014-02-28Paper
Lower bound on the number of the maximum genus embedding of \(K_{n,n}\)2014-02-19Paper
The degree-sum of adjacent vertices, girth and upper embeddability2014-02-19Paper
On the crossing number of the Cartesian product of a 6-vertex graph with \(S_n\)2014-02-19Paper
Crossing number of \(K_{2,3}\vee P_n\)2013-11-19Paper
Classification of embeddings of closed-end multi-ladders on surfaces2013-11-19Paper
The crossing number of Cartesian product of circulant graph \(C(9,2)\) with path \(P_n\)2013-11-19Paper
Counting embeddings of circular graph \(C(2n,2)(n>2)\) on the projective plane2013-06-20Paper
Embedding on surfaces with small genus of one type of graph2013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49283592013-06-11Paper
Joint-tree model and the maximum genus of graphs2013-04-03Paper
On the crossing number of the generalized Petersen graph \(P(3k,k)\).2012-10-12Paper
The crossing numbers of a 6-vertex graph \(G\) and products \(S_n\)2012-10-05Paper
The crossing number of Petersen graph \(P(4,1)\) with paths \(P_n\)2012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31097292012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31696732011-09-29Paper
Survey of the crossing number of graphs2011-07-19Paper
Embeddings of circular graph \(C(2n+1,2)\) \((n>2)\) on the projective plane2011-03-09Paper
The embedding numbers of circular multi-ladders on the projective plane2011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30718382011-02-05Paper
Upper embeddable graphs with respect to \(A\)-partition on vertices2011-02-05Paper
The crossing number of the circulant graph \(C(3k-1;\{1,k\})\)2011-01-10Paper
The crossing number of Cartesian product of \(P_n\) with circulant graph \(C(10,2)\)2010-11-05Paper
The vertice degree condition on upper embeddability of graphs2010-11-05Paper
The crossing numbers of Cartesian products of stars with a 5-vertex graph2010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q35779172010-07-09Paper
https://portal.mardi4nfdi.de/entity/Q35724502010-07-08Paper
Crossing numbers of Cartesian products of stars with 5-vertex graphs2010-07-08Paper
The crossing numbers of Cartesian products of stars and 5-vertex graphs2010-07-08Paper
On the lower bounds for the maximum genus for simple graphs2010-06-17Paper
Maximum genus, degree of vertex and girth2010-02-12Paper
The maximum genus on graphs in terms of diameter and girth2010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36562202010-01-13Paper
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
On the crossing numbers of \(K_5\times S_n\)2009-11-11Paper
Crossing number of the complete tripartite graph \(K_{1,10,n}\)2009-07-22Paper
Upper embeddability of graphs and vertex degree in a cycle2009-07-22Paper
The crossing number of \(C(8,2)\square P_{n}\)2009-05-08Paper
The crossing number of \(W_4\times S_n\)2009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36090532009-03-06Paper
Maximum genus of graphs embedded in the Klein bottle2009-03-06Paper
The crossing number of the complete quadruple graph2008-08-06Paper
Classes of upper-embeddable graphs in terms of dominate vertices set2008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q54556462008-04-04Paper
Upper embeddability of graphs, independence number, and the degree sum of nonadjacent vertices2008-04-04Paper
The crossing number of \(K_{3,3}\times P_n\)2008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54556322008-04-04Paper
On the crossing numbers of products of paths with 6-vertex graphs2008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54539232008-04-03Paper
https://portal.mardi4nfdi.de/entity/Q54539292008-04-03Paper
The crossing number of \(K_{1,4,n}\)2008-03-13Paper
On the crossing number of the complete tripartite graph \(K_{1,8,n}\)2007-06-14Paper
A note on the computational complexity of graph vertex partition2007-03-02Paper
https://portal.mardi4nfdi.de/entity/Q33688832006-02-08Paper
https://portal.mardi4nfdi.de/entity/Q33688792006-02-08Paper
Maximum genus, connectivity and minimal degree of graphs2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q56939982005-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30230742005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46594732005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46594492005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q48110172004-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44689552004-06-14Paper
Maximum genus and chromatic number of graphs2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q47096072003-06-22Paper
Maximum genus of a graph in terms of its embedding properties.2003-04-28Paper
Face size and the maximum genus of a graph. I: Simple graphs2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q31543492002-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45457062002-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45440452002-08-11Paper
Orientable quadrangulation of graphs2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45295502002-05-05Paper
A characterization of the Betti number of graphs2002-04-08Paper
Maximum genus, dominate number and girth of a graph2002-03-04Paper
https://portal.mardi4nfdi.de/entity/Q45036442001-08-16Paper
A note on the maximum genus of 3-edge-connected nonsimple graphs2001-05-10Paper
Maximum genus, independence number and girth2001-04-20Paper
https://portal.mardi4nfdi.de/entity/Q45036802001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45284182001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45283222001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45283672001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45029262000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q42370482000-11-20Paper
https://portal.mardi4nfdi.de/entity/Q38371012000-05-18Paper
Extensions on 2-edge connected 3-regular up-embeddable graphs2000-02-02Paper
The maximum genus of graphs with diameter three1999-08-09Paper
A new infinite family of 4-regular crossing-critical graphsN/APaper
4-connected 1-planar chordal graphs are Hamiltonian-connectedN/APaper

Research outcomes over time

This page was built for person: Yuanqiu Huang