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

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

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

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

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

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

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

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

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

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

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

Disjoint Essential Circuits in Toroidal Maps. - Bojan Mohar; Neil Robertson 001 (Planar Graphs, 1991)

Finding disjoint trees in planar graphs in linear time. - Bruce A. Reed; Neil Robertson 001; Alexander Schrijver; Paul D. Seymour (Graph Structure Theory, 1991)

Excluding a graph with one crossing. - Neil Robertson 001; Paul D. Seymour (Graph Structure Theory, 1991)

A survey of linkless embeddings. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Graph Structure Theory, 1991)

Structural descriptions of lower ideals of trees. - Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (Graph Structure Theory, 1991)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Efficiently Four-Coloring Planar Graphs. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (STOC, 1996)

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

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

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

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

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

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). - William McCuaig; Neil Robertson 001; Paul D. Seymour; Robin Thomas 001 (STOC, 1997)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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