The following pages link to Yan Wang (Q501986):
Displayed 14 items.
- Induced forests in bipartite planar graphs (Q501988) (← links)
- The Kelmans-Seymour conjecture. I: Special separations (Q777488) (← links)
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) (Q777489) (← links)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) (Q777490) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- 7-connected graphs are 4-ordered (Q2284739) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Balanced Subdivisions of a Large Clique in Graphs with High Average Degree (Q6161261) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
- On stability of rainbow matchings (Q6426269) (← links)