Graphs without K4 and well-quasi-ordering. - Robin Thomas 001 (J. Comb. Theory B, 1985)

A Separator Theorem for Graphs with an Excluded Minor and its Applications - Noga Alon; Paul D. Seymour; Robin Thomas 001 (STOC, 1990)

Clique-sums, tree-decompositions and compactness. - Igor Kríz; Robin Thomas 001 (Discret. Math., 1990)

On well-quasi-ordering finite structures with labels. - Igor Kríz; Robin Thomas 001 (Graphs Comb., 1990)

A menger-like property of tree-width: The finite case. - Robin Thomas 001 (J. Comb. Theory B, 1990)

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)

Analyzing Nash-Williams' partition theorem by means of ordinal types. - Igor Kríz; Robin Thomas 001 (Discret. Math., 1991)

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

An end-faithful spanning tree counterexample. - Paul D. Seymour; Robin Thomas 001 (Discret. Math., 1991)

Algorithms Finding Tree-Decompositions of Graphs. - Jirí Matousek 001; Robin Thomas 001 (J. Algorithms, 1991)

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

The menger-like property of the tree-width of infinite graphs. - Igor Kríz; Robin Thomas 001 (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)

On the complexity of finding iso- and other morphisms for partial k-trees. - Jirí Matousek 001; Robin Thomas 001 (Discret. Math., 1992)

Monochromatic Vs multicolored paths. - Hanno Lefmann; Vojtech Rödl; Robin Thomas 001 (Graphs Comb., 1992)

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

Typical Subgraphs of 3- and 4-Connected Graphs. - Bogdan Oporowski; James G. Oxley; Robin Thomas 001 (J. Comb. Theory B, 1993)

Graph Searching and a Min-Max Theorem for Tree-Width. - Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1993)

Call Routing and the Ratcatcher. - Paul D. Seymour; Robin Thomas 001 (Comb., 1994)

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

4-Connected Projective-Planar Graphs Are Hamiltonian. - Robin Thomas 001; Xingxing Yu (J. Comb. Theory B, 1994)

Planar Separators. - Noga Alon; Paul D. Seymour; Robin Thomas 001 (SIAM J. Discret. Math., 1994)

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)

On the Genus of a Random Graph. - Vojtech Rödl; Robin Thomas 001 (Random Struct. Algorithms, 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)

Spanning paths in infinite planar graphs. - Nathaniel Dean; Robin Thomas 001; Xingxing Yu (J. Graph Theory, 1996)

Uniqueness of highly representative surface embeddings. - Paul D. Seymour; Robin Thomas 001 (J. Graph Theory, 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)

Five-Connected Toroidal Graphs Are Hamiltonian. - Robin Thomas 001; Xingxing Yu (J. Comb. Theory B, 1997)

Graph Planarity and Related Topics. - Robin Thomas 001 (GD, 1999)

List Edge-Colorings of Series-Parallel Graphs. - Martin Juvan; Bojan Mohar; Robin Thomas 001 (Electron. J. Comb., 1999)

Excluding a Countable Clique. - Reinhard Diestel; Robin Thomas 001 (J. Comb. Theory B, 1999)

Digraph minors and algorithms (abstract only). - Robin Thomas 001 (SODA, 2000)

Excluding Minors In Nonplanar Graphs Of Girth At Least Five. - Robin Thomas 001; Jan Mcdonald Thomson (Comb. Probab. Comput., 2000)

Clique Minors in Graphs and Their Complements. - Bruce A. Reed; Robin Thomas 001 (J. Comb. Theory B, 2000)

A new proof of the independence ratio of triangle-free cubic graphs. - Christopher Carl Heckman; Robin Thomas 001 (Discret. Math., 2001)

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

Large induced forests in sparse graphs. - Noga Alon; Dhruv Mubayi; Robin Thomas 001 (J. Graph Theory, 2001)

Generating Internally Four-Connected Graphs. - Thor Johnson; Robin Thomas 001 (J. Comb. Theory B, 2002)

Temperely-Lieb Algebras and the Four-Color Theorem. - Louis H. Kauffman; Robin Thomas 001 (Comb., 2003)

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

Three-coloring Klein bottle graphs of girth five. - Robin Thomas 001; Barrett Walls (J. Comb. Theory B, 2004)

On possible counterexamples to Negami's planar cover conjecture. - Petr Hlinený; Robin Thomas 001 (J. Graph Theory, 2004)

Generation of simple quadrangulations of the sphere. - Gunnar Brinkmann; Sam Greenberg; Catherine S. Greenhill; Brendan D. McKay; Robin Thomas 001; Paul Wollan (Discret. Math., 2005)

An improved linear edge bound for graph linkages. - Robin Thomas 001; Paul Wollan (Eur. J. Comb., 2005)

Hamilton paths in toroidal graphs. - Robin Thomas 001; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2005)

The Circular Chromatic Index of Flower Snarks. - Mohammad Ghebleh; Daniel Král; Serguei Norine; Robin Thomas 001 (Electron. J. Comb., 2006)

Independent sets in triangle-free cubic planar graphs. - Christopher Carl Heckman; Robin Thomas 001 (J. Comb. Theory B, 2006)

Proper minor-closed families are small. - Serguei Norine; Paul D. Seymour; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2006)

Minimal bricks. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2006)

The extremal function for K9 minors. - Zi-Xia Song; Robin Thomas 001 (J. Comb. Theory B, 2006)

Generating bricks. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2007)

Coloring even-faced graphs in the torus and the Klein bottle. - Daniel Král; Robin Thomas 001 (Comb., 2008)

Pfaffian labelings and signs of edge colorings. - Serguei Norine; Robin Thomas 001 (Comb., 2008)

Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

Minimally non-Pfaffian graphs. - Serguei Norine; Robin Thomas 001 (J. Comb. Theory B, 2008)

The extremal function for 3-linked graphs. - Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2008)

Kt Minors in Large t-Connected Graphs. - Robin Thomas 001 (IWOCA, 2009)

Coloring triangle-free graphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (SODA, 2009)

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. - Arash Asadi; Luke Postle; Robin Thomas 001 (Electron. Notes Discret. Math., 2009)

Deciding First-Order Properties for Sparse Graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (FOCS, 2010)

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

Voting in Agreeable Societies. - Deborah E. Berg; Serguei Norine; Francis Edward Su; Robin Thomas 001; Paul Wollan (Am. Math. Mon., 2010)

Packing directed circuits exactly. - Bertrand Guenin; Robin Thomas 001 (Comb., 2011)

Edge-coloring series-parallel multigraphs - Cristina G. Fernandes; Robin Thomas 001 (CoRR, 2011)

Minor-Minimal Planar Graphs of Even Branch-Width. - Torsten Inkmann; Robin Thomas 001 (Comb. Probab. Comput., 2011)

Minor-minimal non-projective planar graphs with an internal 3-separation. - Arash Asadi; Luke Postle; Robin Thomas 001 (Electron. Notes Discret. Math., 2011)

Large non-planar graphs and an application to crossing-critical graphs. - Guoli Ding; Bogdan Oporowski; Robin Thomas 001; Dirk Vertigan (J. Comb. Theory B, 2011)

Three-coloring triangle-free planar graphs in linear time. - Zdenek Dvorák 001; Ken-ichi Kawarabayashi; Robin Thomas 001 (ACM Trans. Algorithms, 2011)

K_6 minors in 6-connected graphs of bounded tree-width - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

K_6 minors in large 6-connected graphs - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (CoRR, 2012)

Five-coloring graphs on the Klein bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger (J. Comb. Theory B, 2012)

Nested cycles in large triangulations and crossing-critical graphs. - César Hernández-Vélez; Gelasio Salazar; Robin Thomas 001 (J. Comb. Theory B, 2012)

Arrangeability and Clique Subdivisions. - Vojtech Rödl; Robin Thomas 001 (The Mathematics of Paul Erdős II, 2013)

Odd K_3, 3 subdivisions in bipartite graphs. - Robin Thomas 001; Peter Whalen (CoRR, 2013)

Testing first-order properties for subclasses of sparse graphs. - Zdenek Dvorák 001; Daniel Král; Robin Thomas 001 (J. ACM, 2013)

Sub-exponentially many 3-colorings of triangle-free planar graphs. - Arash Asadi; Zdenek Dvorák 001; Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2013)

List-coloring apex-minor-free graphs. - Zdenek Dvorák 001; Robin Thomas 001 (CoRR, 2014)

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)

Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2015)

Hyperbolic families and coloring graphs on surfaces. - Luke Postle; Robin Thomas 001 (CoRR, 2016)

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2016)

Three-edge-colouring doublecross cubic graphs. - Katherine Edwards; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2016)

Non-planar extensions of subdivisions of planar graphs. - Sergey Norin; Robin Thomas 001 (J. Comb. Theory B, 2016)

Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2016)

Odd K3, 3 subdivisions in bipartite graphs. - Robin Thomas 001; Peter Whalen (J. Comb. Theory B, 2016)

Deploying Robots With Two Sensors in K1, 6-Free Graphs. - Waseem Abbas; Magnus Egerstedt; Chun-Hung Liu; Robin Thomas 001; Peter Whalen (J. Graph Theory, 2016)

Minors of two-connected graphs of large path-width. - Thanh N. Dang; Robin Thomas 001 (CoRR, 2017)

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

Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2018)

Non-embeddable extensions of embedded minors. - Rajneesh Hegde; Robin Thomas 001 (J. Comb. Theory B, 2018)

K6 minors in large 6-connected graphs. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

A new proof of the flat wall theorem. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2018)

Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2018)

Four Edge-Independent Spanning Trees. - Alexander Hoyer; Robin Thomas 001 (SIAM J. Discret. Math., 2018)

The Extremal Function for Bipartite Linklessly Embeddable Graphs. - Rose McCarty; Robin Thomas 001 (Comb., 2019)

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

The extremal functions for triangle-free graphs with excluded minors. - Robin Thomas 001; Youngho Yoo (Eur. J. Comb., 2019)

K6 minors in 6-connected graphs of bounded tree-width. - Ken-ichi Kawarabayashi; Serguei Norine; Robin Thomas 001; Paul Wollan (J. Comb. Theory B, 2019)

Excluding subdivisions of bounded degree graphs. - Chun-Hung Liu; Robin Thomas 001 (J. Comb. Theory B, 2019)

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

Quickly excluding a non-planar graph. - Ken-ichi Kawarabayashi; Robin Thomas 001; Paul Wollan (CoRR, 2020)

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2020)

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2021)

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2022)

On 2-cycles of graphs. - Sergey Norin; Robin Thomas 001; Hein van der Holst (J. Comb. Theory B, 2023)

Properties of 8-contraction-critical graphs with no K7 minor. - Martin Rolek; Zi-Xia Song; Robin Thomas 001 (Eur. J. Comb., 2023)

Packing A-paths of length zero modulo a prime. - Robin Thomas 001; Youngho Yoo (J. Comb. Theory B, 2023)

Packing cycles in undirected group-labelled graphs. - Robin Thomas 001; Youngho Yoo (J. Comb. Theory B, 2023)

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. - Zdenek Dvorák 001; Daniel Král'; Robin Thomas 001 (J. Comb. Theory B, 2024)