Neil Robertson

Publication Activity (10 Years)

Years Active: 1974-2021
Publications (10 Years): 6

Top Topics

Graph Theoretic

Series Parallel

Top Venues

J. Comb. Theory, Ser. B

Publications

Jialie Shen, Neil Robertson
BBAS: Towards large scale effective ensemble adversarial attacks against deep neural network learning. Inf. Sci. 569 (2021)
Neil Robertson, Paul D. Seymour, Robin Thomas
Girth Six Cubic Graphs Have Petersen Minors. Comb. 39 (6) (2019)
Neil Robertson, Paul D. Seymour, Robin Thomas
Excluded minors in cubic graphs. J. Comb. Theory, Ser. B 138 (2019)
John Maharry, Neil Robertson, Vaidy Sivaraman, Daniel C. Slilaty
Flexibility of projective-planar embeddings. J. Comb. Theory, Ser. B 122 (2017)
Neil Robertson, Paul D. Seymour, Robin Thomas
Cyclically five-connected cubic graphs. J. Comb. Theory, Ser. B 125 (2017)
John Maharry, Neil Robertson
The structure of graphs not topologically containing the Wagner graph. J. Comb. Theory, Ser. B 121 (2016)
Neil Robertson, Paul D. Seymour, Robin Thomas
Cyclically five-connected cubic graphs. CoRR (2015)
Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
Excluding A Grid Minor In Planar Digraphs. CoRR (2015)
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
Reducibility in the Four-Color Theorem. CoRR (2014)
Neil Robertson, Paul D. Seymour, Robin Thomas
Girth six cubic graphs have Petersen minors. CoRR (2014)
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
Discharging cartwheels. CoRR (2014)
Neil Robertson, Paul D. Seymour
Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory, Ser. B 102 (2) (2012)
Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha
On a Conjecture Concerning the Petersen Graph. Electron. J. Comb. 18 (1) (2011)
Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
-free graphs with no odd holes. J. Comb. Theory, Ser. B 100 (3) (2010)
Neil Robertson, Zi-Xia Song
Hadwiger number and chromatic number for near regular degree sequences. J. Graph Theory 64 (3) (2010)
Neil Robertson, Paul D. Seymour
Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory, Ser. B 100 (2) (2010)
Neil Robertson, Paul D. Seymour
Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory, Ser. B 99 (3) (2009)
Neil Robertson, Xiaoya Zha, Yue Zhao
On the flexibility of toroidal embeddings. J. Comb. Theory, Ser. B 98 (1) (2008)
James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
Obstructions to branch-decomposition of matroids. J. Comb. Theory, Ser. B 96 (4) (2006)
Yared Nigussie, Neil Robertson
On structural descriptions of lower ideals of trees. J. Graph Theory 50 (3) (2005)
Neil Robertson, Paul D. Seymour
Graph Minors. XX. Wagner's conjecture. J. Comb. Theory, Ser. B 92 (2) (2004)
Neil Robertson, Paul D. Seymour
Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory, Ser. B 90 (2) (2004)
Neil Robertson, Paul D. Seymour
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory, Ser. B 89 (1) (2003)
James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle
. J. Comb. Theory, Ser. B 88 (2) (2003)
Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
Progress on perfect graphs. Math. Program. 97 (1-2) (2003)
Neil Robertson, Paul D. Seymour
Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory, Ser. B 89 (1) (2003)
Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
Directed Tree-Width. J. Comb. Theory, Ser. B 82 (1) (2001)
Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson
Paul Catlin 1948-1995. Discret. Math. 230 (1-3) (2001)
Bojan Mohar, Neil Robertson
Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory, Ser. B 83 (1) (2001)
Neil Robertson, Xiaoya Zha
-minors. Discret. Math. 230 (1-3) (2001)
Neil Robertson, Paul D. Seymour
Graph Minors: XVII. Taming a Vortex. J. Comb. Theory, Ser. B 77 (1) (1999)
William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC (1997)
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
The Four-Colour Theorem. J. Comb. Theory, Ser. B 70 (1) (1997)
Neil Robertson, Paul D. Seymour, Robin Thomas
Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70 (1) (1997)
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
Efficiently Four-Coloring Planar Graphs. STOC (1996)
Neil Robertson, Paul D. Seymour
Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68 (1) (1996)
Bojan Mohar, Neil Robertson
Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68 (1) (1996)
Bojan Mohar, Neil Robertson, Richard P. Vitray
Planar graphs on the projective plane. Discret. Math. 149 (1-3) (1996)
Bojan Mohar, Neil Robertson
Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68 (2) (1996)
Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
Packing Directed Circuits. Comb. 16 (4) (1996)
Neil Robertson, Paul D. Seymour, Robin Thomas
Petersen Family Minors. J. Comb. Theory, Ser. B 64 (2) (1995)
Neil Robertson, Paul D. Seymour, Robin Thomas
Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64 (2) (1995)
Neil Robertson, Paul D. Seymour
Graph Minors .XII. Distance on a Surface. J. Comb. Theory, Ser. B 64 (2) (1995)
Neil Robertson, Paul D. Seymour, Robin Thomas
Kuratowski Chains. J. Comb. Theory, Ser. B 64 (2) (1995)
Neil Robertson, Paul D. Seymour
Graph Miners .XIV. Extending an Embedding. J. Comb. Theory, Ser. B 65 (1) (1995)
Neil Robertson, Paul D. Seymour
Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B 63 (1) (1995)
J. R. Fiedler, John Philip Huneke, R. Bruce Richter, Neil Robertson
Computing the orientable genus of projective graphs. J. Graph Theory 20 (3) (1995)
Neil Robertson, Paul D. Seymour
Graph Minors. XI. Circuits on a Surface. J. Comb. Theory, Ser. B 60 (1) (1994)
Neil Robertson, Paul D. Seymour, Robin Thomas
Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62 (2) (1994)
Neil Robertson, Paul D. Seymour, Robin Thomas
-free graphs. Comb. 13 (3) (1993)
Bojan Mohar, Neil Robertson
Disjoint Essential Circuits in Toroidal Maps. Planar Graphs (1991)
Neil Robertson, Paul D. Seymour, Robin Thomas
A survey of linkless embeddings. Graph Structure Theory (1991)
Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory (1991)
Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
Quickly excluding a forest. J. Comb. Theory, Ser. B 52 (2) (1991)
Neil Robertson, Paul D. Seymour
Excluding a graph with one crossing. Graph Structure Theory (1991)
Neil Robertson, Robin Thomas
On the orientable genus of graphs embedded in the klein bottle. J. Graph Theory 15 (4) (1991)
Neil Robertson, Paul D. Seymour, Robin Thomas
Excluding infinite minors. Discret. Math. 95 (1-3) (1991)
Neil Robertson, Paul D. Seymour, Robin Thomas
Structural descriptions of lower ideals of trees. Graph Structure Theory (1991)
Neil Robertson, Paul D. Seymour
Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52 (2) (1991)
Neil Robertson, Paul D. Seymour
Graph minors. IX. Disjoint crossed paths. J. Comb. Theory, Ser. B 49 (1) (1990)
Neil Robertson, Paul D. Seymour
Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory, Ser. B 48 (2) (1990)
Neil Robertson, Paul D. Seymour
Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory, Ser. B 48 (2) (1990)
Neil Robertson, Paul D. Seymour
Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory, Ser. B 45 (2) (1988)
Neil Robertson, Paul D. Seymour
Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41 (1) (1986)
Neil Robertson, Paul D. Seymour
Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7 (3) (1986)
Neil Robertson, Paul D. Seymour
Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory, Ser. B 41 (1) (1986)
Neil Robertson, Paul D. Seymour
Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36 (1) (1984)
Neil Robertson, Paul D. Seymour
Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35 (1) (1983)
Ram Prakash Gupta, Jeff Kahn, Neil Robertson
On the maximum number of diagonals of a circuit in a graph. Discret. Math. 32 (1) (1980)
Michael D. Plummer, Neil Robertson
Path traversability in planar graphs. Discret. Math. 7 (3-4) (1974)