The following pages link to Gui Ying Yan (Q591521):
Displaying 50 items.
- (Q272316) (redirect page) (← links)
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Existence of rainbow matchings in strongly edge-colored graphs (Q294535) (← links)
- Judicious partitions of weighted hypergraphs (Q295108) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- A note on semi-coloring of graphs (Q354428) (← links)
- Edge coloring by total labelings of outerplanar graphs (Q381093) (← links)
- Minimum degree, edge-connectivity and radius (Q385477) (← links)
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- \(m\)-dominating \(k\)-ended trees of graphs (Q400391) (← links)
- An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) (← links)
- Improved upper bounds on acyclic edge colorings (Q403494) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- A note on the existence of fractional \(f\)-factors in random graphs (Q477487) (← links)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs (Q526237) (← links)
- (Q669089) (redirect page) (← links)
- Maximal entropy random walk on heterogenous network for miRNA-disease association prediction (Q669090) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- Factor-critical graphs with given number of maximum matchings (Q1015441) (← links)
- Graphs isomorphic to their maximum matching graphs (Q1044320) (← links)
- Existence of subgraphs with orthogonal \((g,f)\)-factorization (Q1392629) (← links)
- \(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs (Q1680883) (← links)
- The classification of \(f\)-coloring of graphs with large maximum degree (Q1740035) (← links)
- 2-arc-transitive regular covers of $K_{n,n}$ having the covering transformation group $\mathbb{Z}_p^2$ (Q1786048) (← links)
- Graphs of \(f\)-class 1 (Q1786886) (← links)
- A new result on Alspach's problem (Q1808723) (← links)
- Orthogonal \([k-1,k+1]\)-factorizations in graphs (Q1918196) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness (Q2115210) (← links)
- Information spreading with relative attributes on signed networks (Q2126223) (← links)
- List injective coloring of planar graphs (Q2155650) (← links)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- On judicious partitions of hypergraphs with edges of size at most 3 (Q2349971) (← links)
- Orthogonal matchings revisited (Q2352074) (← links)
- Star-like factors with large components (Q2356348) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← links)
- \(f\)-class two graphs whose \(f\)-cores have maximum degree two (Q2452406) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- (Q2716006) (← links)
