Gui Ying Yan

From MaRDI portal
Person:591521

Available identifiers

zbMath Open yan.guiyingMaRDI QIDQ591521

List of research outcomes

PublicationDate of PublicationType
Anti-Ramsey number of disjoint union of star-like hypergraphs2024-02-19Paper
Weak-dynamic coloring of graphs beyond-planarity2024-01-29Paper
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs2023-10-05Paper
\(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament2023-08-21Paper
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs2023-06-12Paper
Hypergraph incidence coloring2023-03-10Paper
Rainbow Hamilton cycle in hypergraph system2023-01-31Paper
List injective coloring of planar graphs2022-07-15Paper
Information spreading with relative attributes on signed networks2022-04-14Paper
Graph neural network2022-03-21Paper
The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness2022-03-15Paper
Hypergraph incidence coloring2022-02-06Paper
Improving the Gilbert-Varshamov Bound by Graph Spectral Method2021-04-03Paper
Cut Bounds for Some Weighted Graphs2020-09-24Paper
The classification of \(f\)-coloring of graphs with large maximum degree2019-04-29Paper
An Improved Error Term for Tur$\acute{\rm a}$n Number of Expanded Non-degenerate 2-graphs2019-03-30Paper
Maximal entropy random walk on heterogenous network for miRNA-disease association prediction2019-03-20Paper
Graphs of \(f\)-class 12018-09-25Paper
2-arc-transitive regular covers of $K_{n,n}$ having the covering transformation group $\mathbb{Z}_p^2$2018-09-24Paper
https://portal.mardi4nfdi.de/entity/Q31310142018-01-29Paper
\(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs2017-11-17Paper
https://portal.mardi4nfdi.de/entity/Q53676182017-10-20Paper
Improved upper bound for the degenerate and star chromatic numbers of graphs2017-10-17Paper
On bisections of directed graphs2017-06-19Paper
An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs2017-05-10Paper
Neighbor sum distinguishing edge coloring of subcubic graphs2017-04-21Paper
Algorithm on rainbow connection for maximal outerplanar graphs2017-03-16Paper
Neighbor sum distinguishing total choosability of planar graphs2016-10-12Paper
Neighbor sum distinguishing index of \(K_4\)-minor free graphs2016-07-28Paper
Judicious partitions of weighted hypergraphs2016-06-17Paper
Existence of rainbow matchings in strongly edge-colored graphs2016-06-16Paper
Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz2016-05-23Paper
Acyclic coloring of graphs with some girth restriction2016-05-11Paper
Improved bounds on the generalized acyclic chromatic number2016-04-21Paper
On judicious partitions of uniform hypergraphs2016-04-20Paper
\(m\)-dominating \(k\)-trees of graphs2015-12-08Paper
An improved upper bound on edge weight choosability of graphs2015-09-24Paper
Star-like factors with large components2015-07-29Paper
Orthogonal matchings revisited2015-06-29Paper
On judicious partitions of hypergraphs with edges of size at most 32015-06-18Paper
The \(r\)-acyclic chromatic number of planar graphs2015-05-11Paper
A note on the existence of fractional \(f\)-factors in random graphs2014-12-09Paper
Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz2014-12-03Paper
Improved upper bounds on acyclic edge colorings2014-08-29Paper
An improved upper bound for the neighbor sum distinguishing index of graphs2014-08-26Paper
\(m\)-dominating \(k\)-ended trees of graphs2014-08-21Paper
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable2014-06-11Paper
\(f\)-class two graphs whose \(f\)-cores have maximum degree two2014-06-03Paper
Spanning \(k\)-ended trees of bipartite graphs2014-01-27Paper
Minimum degree, edge-connectivity and radius2013-12-02Paper
https://portal.mardi4nfdi.de/entity/Q28598062013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28598632013-11-19Paper
Edge coloring by total labelings of outerplanar graphs2013-11-15Paper
A note on semi-coloring of graphs2013-07-19Paper
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable2013-01-28Paper
A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH2012-06-12Paper
ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH2011-08-02Paper
On potentially $K_{r+1}-U$-graphical Sequences2010-06-07Paper
Linear time construction of 5-phylogenetic roots for tree chordal graphs2010-03-09Paper
Graphs isomorphic to their maximum matching graphs2009-12-11Paper
Factor-critical graphs with given number of maximum matchings2009-05-08Paper
Strictly chordal graphs are leaf powers2007-02-14Paper
https://portal.mardi4nfdi.de/entity/Q27160062005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q46756732005-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46765132005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q48037972004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q49460222000-03-26Paper
https://portal.mardi4nfdi.de/entity/Q49447812000-03-22Paper
A new result on Alspach's problem2000-02-16Paper
On the optimal four-way switch box routing structures of FPGA greedy routing architectures1999-01-12Paper
Existence of subgraphs with orthogonal \((g,f)\)-factorization1999-01-05Paper
Orthogonal \([k-1,k+1\)-factorizations in graphs]1996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48549031996-03-31Paper
https://portal.mardi4nfdi.de/entity/Q48563091996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q42904321994-08-28Paper
Orthogonal \((g,f)\)-factorizations of bipartite graphs0001-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: Gui Ying Yan