Person:1708382

Available identifiers

zbMath Open huang.yuanqiuMaRDI QIDQ1708382

List of research outcomes

Publication	Date of Publication	Type
A new note on 1-planar graphs with minimum degree 7	2024-03-27	Paper
On the sizes of generalized cactus graphs	2024-03-27	Paper
On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs	2023-11-20	Paper
The generalized 4-connectivity of burnt pancake graphs	2023-10-01	Paper
Zip product of graphs and crossing numbers	2023-09-29	Paper
Maximal 1-plane graphs with dominating vertices	2023-09-11	Paper
The generalized 3-connectivity of burnt pancake graphs and godan graphs	2023-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q5874993	2023-02-09	Paper
The reducibility of optimal 1-planar graphs with respect to the lexicographic product	2022-11-27	Paper
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	2022-11-09	Paper
The generalized 3-connectivity of a family reguar networks	2022-11-01	Paper
New upper bounds for the crossing numbers of crossing-critical graphs	2022-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q5062721	2022-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q5062851	2022-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q5062930	2022-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q5063166	2022-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q5063172	2022-03-17	Paper
The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane	2022-01-03	Paper
https://portal.mardi4nfdi.de/entity/Q3385084	2021-12-17	Paper
A note on the upper embeddability of graphs	2021-12-17	Paper
<italic>K</italic><sub>1,1,<italic>m</italic></sub>□<italic>P</italic><sub><italic>n</italic></sub> 的交叉数	2021-12-17	Paper
A note on the crossing number of the cone of a graph	2021-11-30	Paper
The maximal 1-planarity and crossing numbers of graphs	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4998142	2021-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q4995299	2021-06-23	Paper
On the sizes of bipartite 1-planar graphs	2021-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q4983832	2021-04-26	Paper
The crossing number of Cartesian product of 5-wheel with any tree	2020-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q3300700	2020-07-29	Paper
The crossing number of \(K_{5,n+1} \setminus e\)	2020-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q5209140	2020-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q5206388	2019-12-18	Paper
The crossing number of the hexagonal graph \(H_{3,n}\)	2019-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q4558648	2018-11-29	Paper
The crossing numbers of join of some graphs with \(n\) isolated vertices	2018-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q3176064	2018-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q4568160	2018-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4642897	2018-05-25	Paper
Enumerating Unlabelled Embeddings of Digraphs	2018-04-06	Paper
The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle	2018-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q5355056	2017-09-06	Paper
Two recursive inequalities for crossing numbers of graphs	2017-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q2828989	2016-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q2823337	2016-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q2823364	2016-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q2823381	2016-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q2992097	2016-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q2992136	2016-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q3461186	2016-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q3194083	2015-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q3196096	2015-10-28	Paper
Vertex Splitting and Upper Embeddable Graphs	2015-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q5498263	2015-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q5499441	2015-02-11	Paper
The crossing number of the Cartesian product of paths with complete graphs	2014-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q5398489	2014-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q5398502	2014-02-28	Paper
Lower bound on the number of the maximum genus embedding of $K_{n,n}$	2014-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q5397273	2014-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q5397294	2014-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q2858681	2013-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q2859813	2013-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q2859872	2013-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q4926919	2013-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q5299654	2013-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q4928359	2013-06-11	Paper
Joint-tree model and the maximum genus of graphs	2013-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q3166464	2012-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q2916457	2012-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q2887154	2012-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q3109729	2012-01-27	Paper
https://portal.mardi4nfdi.de/entity/Q3169673	2011-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q3014503	2011-07-19	Paper
https://portal.mardi4nfdi.de/entity/Q3082059	2011-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q3071273	2011-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q3071838	2011-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q3071839	2011-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q3066318	2011-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q3054095	2010-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q3054116	2010-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q3054358	2010-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q3577917	2010-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q3571605	2010-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q3572446	2010-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q3572450	2010-07-08	Paper
On the lower bounds for the maximum genus for simple graphs	2010-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3403815	2010-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3405294	2010-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3656220	2010-01-13	Paper
Upper embeddability, edge independence number and girth	2009-12-11	Paper
Upper embeddability, girth and the degree-sum of nonadjacent vertices	2009-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q3640635	2009-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3641577	2009-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3641765	2009-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3642335	2009-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q5318502	2009-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q5319059	2009-07-22	Paper
The crossing number of \(C(8,2)\square P_{n}\)	2009-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q3609053	2009-03-06	Paper
https://portal.mardi4nfdi.de/entity/Q3610354	2009-03-06	Paper
https://portal.mardi4nfdi.de/entity/Q3610845	2009-03-06	Paper
https://portal.mardi4nfdi.de/entity/Q3517917	2008-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q3517919	2008-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q5452792	2008-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5455632	2008-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5455646	2008-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5455655	2008-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5456330	2008-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q5453923	2008-04-03	Paper
https://portal.mardi4nfdi.de/entity/Q5453929	2008-04-03	Paper
The crossing number of \(K_{1,4,n}\)	2008-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q3446391	2007-06-14	Paper
A note on the computational complexity of graph vertex partition	2007-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q3368879	2006-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q3368883	2006-02-08	Paper
Maximum genus, connectivity and minimal degree of graphs	2005-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q5693998	2005-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q3023074	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4659449	2005-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4659473	2005-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4811017	2004-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4468955	2004-06-14	Paper
Maximum genus and chromatic number of graphs	2003-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q4709607	2003-06-22	Paper
Maximum genus of a graph in terms of its embedding properties.	2003-04-28	Paper
Face size and the maximum genus of a graph. I: Simple graphs	2002-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q3154349	2002-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q4545706	2002-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4544045	2002-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q2757130	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4529550	2002-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q2721751	2002-04-08	Paper
https://portal.mardi4nfdi.de/entity/Q2725256	2002-03-04	Paper
https://portal.mardi4nfdi.de/entity/Q4503644	2001-08-16	Paper
A note on the maximum genus of 3-edge-connected nonsimple graphs	2001-05-10	Paper
Maximum genus, independence number and girth	2001-04-20	Paper
https://portal.mardi4nfdi.de/entity/Q4503680	2001-03-30	Paper
https://portal.mardi4nfdi.de/entity/Q4528322	2001-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q4528367	2001-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q4528418	2001-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q4502926	2000-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q4237048	2000-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q3837101	2000-05-18	Paper
Extensions on 2-edge connected 3-regular up-embeddable graphs	2000-02-02	Paper
The maximum genus of graphs with diameter three	1999-08-09	Paper
A new infinite family of 4-regular crossing-critical graphs	0001-01-03	Paper
4-connected 1-planar chordal graphs are Hamiltonian-connected	0001-01-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Yuan Qiu Huang