Yuping Gao

From MaRDI portal
Person:1709429

Available identifiers

zbMath Open gao.yupingMaRDI QIDQ1709429

List of research outcomes





PublicationDate of PublicationType
Toughness and the existence of $k$-factors in hypergraphs2023-04-27Paper
Erdős-Gyárfás conjecture for \(P_8\)-free graphs2022-10-13Paper
Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs2022-09-26Paper
Product antimagic labeling of caterpillars2021-11-24Paper
Nonempty intersection of longest paths in graphs without forbidden pairs2021-09-30Paper
The edge colorings of \(K_5\)-minor free graphs2021-04-28Paper
Antimagic orientation of lobsters2020-10-14Paper
Equitable partition of plane graphs with independent crossings into induced forests2020-03-20Paper
The edge colorings of $K_{5}$-minor free graphs2020-02-24Paper
On the extremal graphs with respect to the total reciprocal edge-eccentricity2020-02-03Paper
Chromatic index determined by fractional chromatic index2018-05-09Paper
Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz2018-04-05Paper
Equitable vertex arboricity of 5-degenerate graphs2017-10-17Paper
Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph2017-02-08Paper
A relaxed case on 1-2-3 conjecture2016-07-28Paper
Neighbor sum distinguishing edge colorings of graphs with small maximum average degree2016-07-11Paper
Not necessarily proper total colourings which are adjacent vertex distinguishing2014-01-29Paper
The digraceful of \(\overrightarrow{P_n}\) and \(\overrightarrow{C_n}\)2013-11-19Paper
Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\))2013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49009772013-01-24Paper
Vertex-distinguishing proper edge-coloring chromatic numbers of the composition of two graphs2012-06-01Paper
Some results on total weight choosabilityN/APaper

Research outcomes over time

This page was built for person: Yuping Gao