The following pages link to Xingxing Yu (Q251549):
Displaying 32 items.
- Infinite paths in planar graphs II, structures and ladder nets (Q4677771) (← links)
- Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three (Q4693361) (← links)
- Long cycles in 3‐connected graphs in orientable surfaces (Q4798104) (← links)
- Hamilton cycles in plane triangulations (Q4798110) (← links)
- (Q4842716) (← links)
- (Q4894619) (← links)
- Number of Hamiltonian Cycles in Planar Triangulations (Q4990401) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Balanced judicious bipartitions of graphs (Q5190331) (← links)
- Better Bounds for <i>k</i>-Partitions of Graphs (Q5199512) (← links)
- Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463) (← links)
- Infinite paths in planar graphs V, 3‐indivisible graphs (Q5387017) (← links)
- Infinite paths in planar graphs III, 1-way infinite paths (Q5469138) (← links)
- Finding Four Independent Trees (Q5470724) (← links)
- Nonseparating Planar Chains in 4-Connected Graphs (Q5470768) (← links)
- Chain Decompositions of 4-Connected Graphs (Q5470797) (← links)
- Computing and Combinatorics (Q5717010) (← links)
- On the cycle‐isomorphism of graphs (Q5749318) (← links)
- On judicious bipartitions of graphs (Q5915867) (← links)
- On judicious bipartitions of graphs (Q5918718) (← links)
- On a coloring conjecture of Hajós (Q5964996) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Partitioning digraphs with outdegree at least 4 (Q6056760) (← links)
- Wheels in planar graphs and Hajós graphs (Q6056778) (← links)
- 4‐Separations in Hajós graphs (Q6057653) (← links)
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs (Q6170792) (← links)
- A class of trees determined by their chromatic symmetric functions (Q6512376) (← links)
- A class of trees determined by their chromatic symmetric functions (Q6553184) (← links)
- Linkages and removable paths avoiding vertices (Q6615754) (← links)
- Dense circuit graphs and the planar Turán number of a cycle (Q6642513) (← links)
- A short proof of the Goldberg-Seymour conjecture (Q6736332) (← links)
