On hamiltonian line graphs and connectivity
- 作者Siming Zhan
- 卷第89卷
- 期第1期
- 印刷ISSN0012-365X
- 文件大小444.36KB
- 发表时间1991
- DOI10.1016/0012-365x(91)90401-m
- 页码89-95
Proper minor-closed families are smallSerguei Norine; Paul Seymour; Robin Thomas; Paul Wollan · 2006
The Four-Colour TheoremNeil Robertson; Daniel Sanders; Paul Seymour; Robin Thomas · 1997
Tutte's Edge-Colouring ConjectureNeil Robertson; Paul Seymour; Robin Thomas · 1997
Excluding infinite minorsNeil Robertson; Paul Seymour; Robin Thomas · 1991
Packing directed circuitsBruce Reed; Neil Robertson; Paul Seymour; Robin Thomas · Combinatorica · 1996
Quickly excluding a forestDan Bienstock; Neil Robertson; Paul Seymour; Robin Thomas · 1991
Planar SeparatorsAlon, Noga; Seymour, Paul; Thomas, Robin · SIAM Journal on Discrete Mathematics · 1994
The Strong Perfect Graph TheoremMaria Chudnovsky, Neil Robertson, Paul Seymour and Robin Thomas · Annals of Mathematics (Second Series) · 2006