Neil Robertson

71 papers A* 2Journal 63Unranked 5

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