Neil Robertson

From MaRDI portal
Person:175487

Available identifiers

zbMath Open robertson.neilDBLP04/5627WikidataQ1531456 ScholiaQ1531456MaRDI QIDQ175487

List of research outcomes





PublicationDate of PublicationType
Girth six cubic graphs have Petersen minors2020-02-26Paper
Excluded minors in cubic graphs2019-07-17Paper
Cyclically five-connected cubic graphs2017-05-26Paper
Flexibility of projective-planar embeddings2016-11-25Paper
Excluding A Grid Minor In Planar Digraphs2015-10-01Paper
Reducibility in the Four-Color Theorem2014-01-24Paper
Discharging cartwheels2014-01-24Paper
Graph minors. XXII. Irrelevant vertices in linkage problems2012-05-04Paper
Hadwiger number and chromatic number for near regular degree sequences2010-11-10Paper
Graph minors XXIII. Nash-Williams' immersion conjecture2010-04-21Paper
\(K_{4}\)-free graphs with no odd holes2010-04-21Paper
Graph minors. XXI. graphs with unique linkages2009-06-23Paper
On the flexibility of toroidal embeddings2007-12-10Paper
The strong perfect graph theorem2007-01-04Paper
Obstructions to branch-decomposition of matroids2006-07-12Paper
On structural descriptions of lower ideals of trees2005-12-08Paper
Graph minors. XX: Wagner's conjecture2005-02-16Paper
Graph minors. XIX: Well-quasi-ordering on a surface.2004-03-14Paper
Graph minors. XVI: Excluding a non-planar graph2003-10-15Paper
Graph minors. XVIII: Tree-decompositions and well-quasi-ordering2003-10-15Paper
Progress on perfect graphs2003-09-01Paper
On the excluded minors for the matroids of branch-width \(k\)2003-08-17Paper
Directed tree-width2002-12-10Paper
Flexibility of polyhedral embeddings of graphs in surfaces2002-12-10Paper
Closed 2-cell embeddings of graphs with no \(V_8\)-minors2001-10-30Paper
Paul Catlin 1948-19952001-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45270072001-02-28Paper
Graph minors. XVII: Taming a vortex2000-06-25Paper
Permanents, Pfaffian orientations, and even directed circuits2000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q42285121999-05-18Paper
The four-colour theorem1998-03-16Paper
Packing directed circuits1998-01-11Paper
Tutte's edge-colouring conjecture1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43408791997-06-15Paper
Graph minors. XV: Giant steps1997-04-21Paper
Planar graphs on nonplanar surfaces1997-02-17Paper
Disjoint essential cycles1996-12-08Paper
Graph minors. XII: Distance on a surface1996-07-04Paper
Computing the orientable genus of projective graphs1996-05-13Paper
Planar graphs on the projective plane1996-03-25Paper
Sachs' linkless embedding conjecture1996-02-20Paper
Hadwiger's conjecture for \(K_ 6\)-free graphs1996-01-18Paper
Excluding infinite clique minors1995-12-11Paper
Petersen family minors1995-09-20Paper
Graph minors. XIV: Extending an embedding1995-09-20Paper
Kuratowski chains1995-09-20Paper
Graph minors. XIII: The disjoint paths problem1995-07-02Paper
Quickly excluding a planar graph1995-03-02Paper
Graph minors. XI: Circuits on a surface1994-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42738771994-10-10Paper
https://portal.mardi4nfdi.de/entity/Q42738511994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q42738381994-01-06Paper
https://portal.mardi4nfdi.de/entity/Q42738691994-01-06Paper
https://portal.mardi4nfdi.de/entity/Q31382911993-12-15Paper
Linkless embeddings of graphs in 3-space1993-06-29Paper
Excluding Subdivisions of Infinite Cliques1993-01-16Paper
Excluding infinite minors1992-09-27Paper
Graph minors. X: Obstructions to tree-decomposition1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39729531992-06-26Paper
Quickly excluding a forest1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39729541992-06-26Paper
On the orientable genus of graphs embedded in the klein bottle1992-06-26Paper
Graph minors. IX: Disjoint crossed paths1992-06-25Paper
Graph minors. VIII: A Kuratowski theorem for general surfaces1990-01-01Paper
Graph minors. IV: Tree-width and well-quasi-ordering1990-01-01Paper
Graph minors. VII: Disjoint paths on a surface1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721451988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738821987-01-01Paper
Graph minors. V. Excluding a planar graph1986-01-01Paper
Graph minors. II. Algorithmic aspects of tree-width1986-01-01Paper
Graph minors. VI. Disjoint paths across a disc1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841391985-01-01Paper
Disjoint Paths—A Survey1985-01-01Paper
Graph minors. III. Planar tree-width1984-01-01Paper
Minimal Cyclic-4-Connected Graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206371984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808751984-01-01Paper
Graph minors. I. Excluding a forest1983-01-01Paper
On the maximum number of diagonals of a circuit in a graph1980-01-01Paper
Path traversability in planar graphs1974-01-01Paper
Automorphisms of subgraphs obtained by deleting a pendant vertex1972-01-01Paper
Automorphisms of subgraphs obtained by deleting a pendant vertex1972-01-01Paper
Pentagon-Generated Trivalent Graphs with Girth 51971-01-01Paper
The smallest graph of girth 5 and valency 41964-01-01Paper
Excluding disjoint Kuratowski graphsN/APaper
Excluding sums of Kuratowski graphsN/APaper

Research outcomes over time

This page was built for person: Neil Robertson