Yuan Qiu Huang

From MaRDI portal
Revision as of 02:31, 13 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Yuan Qiu Huang to Yuan Qiu Huang: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1708382

Available identifiers

zbMath Open huang.yuanqiuMaRDI QIDQ1708382

List of research outcomes

PublicationDate of PublicationType
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/Q50627212022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50628512022-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
A note on the upper embeddability of graphs2021-12-17Paper
<italic>K</italic><sub>1,1,<italic>m</italic></sub>□<italic>P</italic><sub><italic>n</italic></sub> 的交叉数2021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q33850842021-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
https://portal.mardi4nfdi.de/entity/Q28289892016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28233372016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28233642016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28233812016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29920972016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q29921362016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q34611862016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q31940832015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31960962015-10-28Paper
Vertex Splitting and Upper Embeddable Graphs2015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q54982632015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54994412015-02-11Paper
The crossing number of the Cartesian product of paths with complete graphs2014-05-06Paper
https://portal.mardi4nfdi.de/entity/Q53984892014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53985022014-02-28Paper
Lower bound on the number of the maximum genus embedding of $K_{n,n}$2014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q53972732014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q53972942014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q28586812013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28598132013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28598722013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q52996542013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49269192013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49283592013-06-11Paper
Joint-tree model and the maximum genus of graphs2013-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31664642012-10-12Paper
https://portal.mardi4nfdi.de/entity/Q29164572012-10-05Paper
https://portal.mardi4nfdi.de/entity/Q28871542012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31097292012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31696732011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30145032011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30820592011-03-09Paper
https://portal.mardi4nfdi.de/entity/Q30712732011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30718382011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30718392011-02-05Paper
https://portal.mardi4nfdi.de/entity/Q30663182011-01-10Paper
https://portal.mardi4nfdi.de/entity/Q30540952010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30541162010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q30543582010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q35779172010-07-09Paper
https://portal.mardi4nfdi.de/entity/Q35716052010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35724462010-07-08Paper
https://portal.mardi4nfdi.de/entity/Q35724502010-07-08Paper
On the lower bounds for the maximum genus for simple graphs2010-06-17Paper
https://portal.mardi4nfdi.de/entity/Q34038152010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q34052942010-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/Q36406352009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36415772009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36417652009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36423352009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q53185022009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53190592009-07-22Paper
The crossing number of \(C(8,2)\square P_{n}\)2009-05-08Paper
https://portal.mardi4nfdi.de/entity/Q36090532009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36103542009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q36108452009-03-06Paper
https://portal.mardi4nfdi.de/entity/Q35179172008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35179192008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q54527922008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54556322008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54556462008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54556552008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q54563302008-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
https://portal.mardi4nfdi.de/entity/Q34463912007-06-14Paper
A note on the computational complexity of graph vertex partition2007-03-02Paper
https://portal.mardi4nfdi.de/entity/Q33688792006-02-08Paper
https://portal.mardi4nfdi.de/entity/Q33688832006-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/Q46594492005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46594732005-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
https://portal.mardi4nfdi.de/entity/Q27571302002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45295502002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27217512002-04-08Paper
https://portal.mardi4nfdi.de/entity/Q27252562002-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/Q45283222001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45283672001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45284182001-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 graphs0001-01-03Paper
4-connected 1-planar chordal graphs are Hamiltonian-connected0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yuan Qiu Huang