default search action
Neil Robertson 0001
Person information
- affiliation: Ohio State University, Department of Mathematics, Columbus, Ohio, USA
Other persons with the same name
- Neil Robertson 0002
(aka: Neil M. Robertson, Neil Martin Robertson) — Queen's University, Belfast, UK (and 2 more)
- Neil Robertson 0003 — IBM, San Jose, CA, USA
- Neil Robertson 0004 — British Columbia Cancer Research Centre, Vancouver, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j58]Jialie Shen, Neil Robertson:
BBAS: Towards large scale effective ensemble adversarial attacks against deep neural network learning. Inf. Sci. 569: 469-478 (2021)
2010 – 2019
- 2019
- [j57]Neil Robertson, Paul D. Seymour
Girth Six Cubic Graphs Have Petersen Minors. Comb. 39(6): 1413-1423 (2019) - [j56]Neil Robertson, Paul D. Seymour
Excluded minors in cubic graphs. J. Comb. Theory B 138: 219-285 (2019) - 2017
- [j55]John Maharry, Neil Robertson, Vaidy Sivaraman, Daniel C. Slilaty:
Flexibility of projective-planar embeddings. J. Comb. Theory B 122: 241-300 (2017) - [j54]Neil Robertson, Paul D. Seymour
Cyclically five-connected cubic graphs. J. Comb. Theory B 125: 132-167 (2017) - 2016
- [j53]John Maharry, Neil Robertson:
The structure of graphs not topologically containing the Wagner graph. J. Comb. Theory B 121: 398-420 (2016) - 2015
- [i5]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. CoRR abs/1503.02298 (2015) - [i4]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding A Grid Minor In Planar Digraphs. CoRR abs/1510.00473 (2015) - 2014
- [i3]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Reducibility in the Four-Color Theorem. CoRR abs/1401.6481 (2014) - [i2]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Discharging cartwheels. CoRR abs/1401.6485 (2014) - [i1]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth six cubic graphs have Petersen minors. CoRR abs/1405.0533 (2014) - 2012
- [j52]Neil Robertson, Paul D. Seymour
Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory B 102(2): 530-563 (2012) - 2011
- [j51]Donald Nelson, Michael D. Plummer, Neil Robertson, Xiaoya Zha:
On a Conjecture Concerning the Petersen Graph. Electron. J. Comb. 18(1) (2011) - 2010
- [j50]Neil Robertson, Paul D. Seymour
Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory B 100(2): 181-205 (2010) - [j49]Maria Chudnovsky
K4-free graphs with no odd holes. J. Comb. Theory B 100(3): 313-331 (2010) - [j48]Neil Robertson, Zi-Xia Song:
Hadwiger number and chromatic number for near regular degree sequences. J. Graph Theory 64(3): 175-183 (2010)
2000 – 2009
- 2009
- [j47]Neil Robertson, Paul D. Seymour
Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory B 99(3): 583-616 (2009) - 2008
- [j46]Neil Robertson, Xiaoya Zha, Yue Zhao:
On the flexibility of toroidal embeddings. J. Comb. Theory B 98(1): 43-61 (2008) - 2006
- [j45]James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle:
Obstructions to branch-decomposition of matroids. J. Comb. Theory B 96(4): 560-570 (2006) - 2005
- [j44]Yared Nigussie, Neil Robertson:
On structural descriptions of lower ideals of trees. J. Graph Theory 50(3): 220-233 (2005) - 2004
- [j43]Neil Robertson, Paul D. Seymour
Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory B 90(2): 325-385 (2004) - [j42]Neil Robertson, Paul D. Seymour
Graph Minors. XX. Wagner's conjecture. J. Comb. Theory B 92(2): 325-357 (2004) - 2003
- [j41]James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle:
On the excluded minors for the matroids of branch-width k. J. Comb. Theory B 88(2): 261-265 (2003) - [j40]Neil Robertson, Paul D. Seymour
Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory B 89(1): 43-76 (2003) - [j39]Neil Robertson, Paul D. Seymour
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory B 89(1): 77-108 (2003) - [j38]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003) - 2001
- [j37]Arthur M. Hobbs, Hong-Jian Lai, Neil Robertson:
Paul Catlin 1948-1995. Discret. Math. 230(1-3): 3-12 (2001) - [j36]Neil Robertson, Xiaoya Zha:
Closed 2-cell embeddings of graphs with no V8-minors. Discret. Math. 230(1-3): 207-213 (2001) - [j35]Thor Johnson, Neil Robertson, Paul D. Seymour
Directed Tree-Width. J. Comb. Theory B 82(1): 138-154 (2001) - [j34]Bojan Mohar, Neil Robertson:
Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory B 83(1): 38-57 (2001)
1990 – 1999
- 1999
- [j33]Neil Robertson, Paul D. Seymour
Graph Minors: XVII. Taming a Vortex. J. Comb. Theory B 77(1): 162-210 (1999) - 1997
- [j32]Neil Robertson, Daniel P. Sanders, Paul D. Seymour
The Four-Colour Theorem. J. Comb. Theory B 70(1): 2-44 (1997) - [j31]Neil Robertson, Paul D. Seymour
Tutte's Edge-Colouring Conjecture. J. Comb. Theory B 70(1): 166-183 (1997) - [c7]William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas:
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405 - 1996
- [j30]Bruce A. Reed, Neil Robertson, Paul D. Seymour
Packing Directed Circuits. Comb. 16(4): 535-554 (1996) - [j29]Bojan Mohar, Neil Robertson, Richard P. Vitray:
Planar graphs on the projective plane. Discret. Math. 149(1-3): 141-157 (1996) - [j28]Bojan Mohar, Neil Robertson:
Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996) - [j27]Neil Robertson, Paul D. Seymour
Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68(1): 112-148 (1996) - [j26]Bojan Mohar, Neil Robertson:
Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996) - [c6]Neil Robertson, Daniel P. Sanders, Paul D. Seymour
Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 - 1995
- [j25]Neil Robertson, Paul D. Seymour
Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory B 63(1): 65-110 (1995) - [j24]Neil Robertson, Paul D. Seymour
Kuratowski Chains. J. Comb. Theory B 64(2): 127-154 (1995) - [j23]Neil Robertson, Paul D. Seymour
Petersen Family Minors. J. Comb. Theory B 64(2): 155-184 (1995) - [j22]Neil Robertson, Paul D. Seymour
Sachs' Linkless Embedding Conjecture. J. Comb. Theory B 64(2): 185-227 (1995) - [j21]Neil Robertson, Paul D. Seymour
Graph Minors .XII. Distance on a Surface. J. Comb. Theory B 64(2): 240-272 (1995) - [j20]Neil Robertson, Paul D. Seymour
Graph Minors .XIV. Extending an Embedding. J. Comb. Theory B 65(1): 23-50 (1995) - [j19]J. R. Fiedler, John Philip Huneke, R. Bruce Richter, Neil Robertson:
Computing the orientable genus of projective graphs. J. Graph Theory 20(3): 297-308 (1995) - 1994
- [j18]Neil Robertson, Paul D. Seymour
Graph Minors. XI. Circuits on a Surface. J. Comb. Theory B 60(1): 72-106 (1994) - [j17]Neil Robertson, Paul D. Seymour
Quickly Excluding a Planar Graph. J. Comb. Theory B 62(2): 323-348 (1994) - 1993
- [j16]Neil Robertson, Paul D. Seymour
Hadwiger's conjecture for K 6-free graphs. Comb. 13(3): 279-361 (1993) - [e1]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. Contemporary Mathematics 147, American Mathematical Society 1993, ISBN 0-8218-5160-8 [contents] - 1991
- [j15]Neil Robertson, Paul D. Seymour
Excluding infinite minors. Discret. Math. 95(1-3): 303-319 (1991) - [j14]Neil Robertson, Paul D. Seymour
Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory B 52(2): 153-190 (1991) - [j13]Daniel Bienstock, Neil Robertson, Paul D. Seymour
Quickly excluding a forest. J. Comb. Theory B 52(2): 274-283 (1991) - [j12]Neil Robertson, Robin Thomas:
On the orientable genus of graphs embedded in the klein bottle. J. Graph Theory 15(4): 407-419 (1991) - [c5]Bojan Mohar, Neil Robertson:
Disjoint Essential Circuits in Toroidal Maps. Planar Graphs 1991: 109-130 - [c4]Neil Robertson, Paul D. Seymour, Robin Thomas:
A survey of linkless embeddings. Graph Structure Theory 1991: 125-136 - [c3]Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301 - [c2]Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 - [c1]Neil Robertson, Paul D. Seymour:
Excluding a graph with one crossing. Graph Structure Theory 1991: 669-675 - 1990
- [j11]Neil Robertson, Paul D. Seymour
Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory B 48(2): 227-254 (1990) - [j10]Neil Robertson, Paul D. Seymour
Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory B 48(2): 255-288 (1990) - [j9]Neil Robertson, Paul D. Seymour
Graph minors. IX. Disjoint crossed paths. J. Comb. Theory B 49(1): 40-77 (1990)
1980 – 1989
- 1988
- [j8]Neil Robertson, Paul D. Seymour
Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory B 45(2): 212-254 (1988) - 1986
- [j7]Neil Robertson, Paul D. Seymour
Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3): 309-322 (1986) - [j6]Neil Robertson, Paul D. Seymour
Graph minors. V. Excluding a planar graph. J. Comb. Theory B 41(1): 92-114 (1986) - [j5]Neil Robertson, Paul D. Seymour
Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory B 41(1): 115-138 (1986) - 1984
- [j4]Neil Robertson, Paul D. Seymour
Graph minors. III. Planar tree-width. J. Comb. Theory B 36(1): 49-64 (1984) - 1983
- [j3]Neil Robertson, Paul D. Seymour
Graph minors. I. Excluding a forest. J. Comb. Theory B 35(1): 39-61 (1983) - 1980
- [j2]Ram Prakash Gupta, Jeff Kahn, Neil Robertson:
On the maximum number of diagonals of a circuit in a graph. Discret. Math. 32(1): 37-43 (1980)
1970 – 1979
- 1974
- [j1]Michael D. Plummer, Neil Robertson:
Path traversability in planar graphs. Discret. Math. 7(3-4): 289-303 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: