BBAS: Towards large scale effective ensemble adversarial attacks against deep neural network learning - Jialie Shen; Neil Robertson (Inf. Sci., 2021)

Girth Six Cubic Graphs Have Petersen Minors - Neil Robertson; Paul D. Seymour; Robin Thomas (Comb., 2019)

Excluded minors in cubic graphs - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 2019)

Flexibility of projective-planar embeddings - John Maharry; Neil Robertson; Vaidy Sivaraman; Daniel C. Slilaty (J. Comb. Theory B, 2017)

Cyclically five-connected cubic graphs - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 2017)

The structure of graphs not topologically containing the Wagner graph - John Maharry; Neil Robertson (J. Comb. Theory B, 2016)

Cyclically five-connected cubic graphs - Neil Robertson; Paul D. Seymour; Robin Thomas (CoRR, 2015)

Excluding A Grid Minor In Planar Digraphs - Thor Johnson; Neil Robertson; Paul D. Seymour; Robin Thomas (CoRR, 2015)

Reducibility in the Four-Color Theorem - Neil Robertson; Daniel P. Sanders; Paul D. Seymour; Robin Thomas (CoRR, 2014)

Discharging cartwheels - Neil Robertson; Daniel P. Sanders; Paul D. Seymour; Robin Thomas (CoRR, 2014)

Girth six cubic graphs have Petersen minors - Neil Robertson; Paul D. Seymour; Robin Thomas (CoRR, 2014)

Graph Minors. XXII. Irrelevant vertices in linkage problems - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2012)

On a Conjecture Concerning the Petersen Graph - Donald Nelson; Michael D. Plummer; Neil Robertson; Xiaoya Zha (Electron. J. Comb., 2011)

Graph minors XXIII. Nash-Williams' immersion conjecture - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2010)

K\(_4\)-free graphs with no odd holes - Maria Chudnovsky; Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 2010)

Hadwiger number and chromatic number for near regular degree sequences - Neil Robertson; Zi-Xia Song (J. Graph Theory, 2010)

Graph minors. XXI. Graphs with unique linkages - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2009)

On the flexibility of toroidal embeddings - Neil Robertson; Xiaoya Zha; Yue Zhao (J. Comb. Theory B, 2008)

Obstructions to branch-decomposition of matroids - James F. Geelen; Bert Gerards; Neil Robertson; Geoff Whittle (J. Comb. Theory B, 2006)

On structural descriptions of lower ideals of trees - Yared Nigussie; Neil Robertson (J. Graph Theory, 2005)

Graph Minors. XIX. Well-quasi-ordering on a surface - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2004)

Graph Minors. XX. Wagner's conjecture - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2004)

On the excluded minors for the matroids of branch-width k - James F. Geelen; A. M. H. Gerards; Neil Robertson; Geoff Whittle (J. Comb. Theory B, 2003)

Graph Minors. XVI. Excluding a non-planar graph - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2003)

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 2003)

Progress on perfect graphs - Maria Chudnovsky; Neil Robertson; Paul D. Seymour; Robin Thomas (Math. Program., 2003)

Paul Catlin 1948-1995 - Arthur M. Hobbs; Hong-Jian Lai; Neil Robertson (Discret. Math., 2001)

Closed 2-cell embeddings of graphs with no V\(_8\)-minors - Neil Robertson; Xiaoya Zha (Discret. Math., 2001)

Directed Tree-Width - Thor Johnson; Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 2001)

Flexibility of Polyhedral Embeddings of Graphs in Surfaces - Bojan Mohar; Neil Robertson (J. Comb. Theory B, 2001)

Graph Minors: XVII. Taming a Vortex - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1999)

The Four-Colour Theorem - Neil Robertson; Daniel P. Sanders; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1997)

Tutte's Edge-Colouring Conjecture - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1997)

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract) - William McCuaig; Neil Robertson; Paul D. Seymour; Robin Thomas (Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, 1997)

Packing Directed Circuits - Bruce A. Reed; Neil Robertson; Paul D. Seymour; Robin Thomas (Comb., 1996)

Planar graphs on the projective plane - Bojan Mohar; Neil Robertson; Richard P. Vitray (Discret. Math., 1996)

Planar Graphs on Nonplanar Surfaces - Bojan Mohar; Neil Robertson (J. Comb. Theory, Ser. B, 1996)

Graph Minors: XV. Giant Steps - Neil Robertson; Paul D. Seymour (J. Comb. Theory, Ser. B, 1996)

Disjoint Essential Cycles - Bojan Mohar; Neil Robertson (J. Comb. Theory, Ser. B, 1996)

Efficiently Four-Coloring Planar Graphs - Neil Robertson; Daniel P. Sanders; Paul D. Seymour; Robin Thomas (Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 1996)

Graph Minors .XIII. The Disjoint Paths Problem - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1995)

Kuratowski Chains - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1995)

Petersen Family Minors - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1995)

Sachs' Linkless Embedding Conjecture - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1995)

Graph Minors .XII. Distance on a Surface - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1995)

Graph Minors .XIV. Extending an Embedding - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1995)

Computing the orientable genus of projective graphs - J. R. Fiedler; John Philip Huneke; R. Bruce Richter; Neil Robertson (J. Graph Theory, 1995)

Graph Minors. XI. Circuits on a Surface - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1994)

Quickly Excluding a Planar Graph - Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1994)

Hadwiger's conjecture for K \(_6\)-free graphs - Neil Robertson; Paul D. Seymour; Robin Thomas (Comb., 1993)

Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA - Neil Robertson; Paul D. Seymour (American Mathematical Society, 1993)

Excluding infinite minors - Neil Robertson; Paul D. Seymour; Robin Thomas (Discret. Math., 1991)

Graph minors. X. Obstructions to tree-decomposition - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1991)

Quickly excluding a forest - Daniel Bienstock; Neil Robertson; Paul D. Seymour; Robin Thomas (J. Comb. Theory B, 1991)

On the orientable genus of graphs embedded in the klein bottle - Neil Robertson; Robin Thomas (J. Graph Theory, 1991)

Disjoint Essential Circuits in Toroidal Maps - Bojan Mohar; Neil Robertson (Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, 1991)

A survey of linkless embeddings - Neil Robertson; Paul D. Seymour; Robin Thomas (Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, 1991)

Finding disjoint trees in planar graphs in linear time - Bruce A. Reed; Neil Robertson; Alexander Schrijver; Paul D. Seymour (Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, 1991)

Structural descriptions of lower ideals of trees - Neil Robertson; Paul D. Seymour; Robin Thomas (Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, 1991)

Excluding a graph with one crossing - Neil Robertson; Paul D. Seymour (Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, 1991)

Graph minors. IV. Tree-width and well-quasi-ordering - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1990)

Graph minors. VIII. A kuratowski theorem for general surfaces - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1990)

Graph minors. IX. Disjoint crossed paths - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1990)

Graph minors. VII. Disjoint paths on a surface - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1988)

Graph Minors. II. Algorithmic Aspects of Tree-Width - Neil Robertson; Paul D. Seymour (J. Algorithms, 1986)

Graph minors. V. Excluding a planar graph - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1986)

Graph minors. VI. Disjoint paths across a disc - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1986)

Graph minors. III. Planar tree-width - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1984)

Graph minors. I. Excluding a forest - Neil Robertson; Paul D. Seymour (J. Comb. Theory B, 1983)

On the maximum number of diagonals of a circuit in a graph - Ram Prakash Gupta; Jeff Kahn; Neil Robertson (Discret. Math., 1980)

Path traversability in planar graphs - Michael D. Plummer; Neil Robertson (Discret. Math., 1974)