Robin Thomas

From MaRDI portal
Person:186136

Available identifiers

zbMath Open thomas.robinWikidataQ2159915 ScholiaQ2159915MaRDI QIDQ186136

List of research outcomes

PublicationDate of PublicationType
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations2024-01-29Paper
On 2-cycles of graphs2023-08-10Paper
Packing cycles in undirected group-labelled graphs2023-05-02Paper
Properties of 8-contraction-critical graphs with no \(K_7\) minor2023-04-27Paper
Packing \(A\)-paths of length zero modulo a prime2023-03-23Paper
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm2021-11-17Paper
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs2021-07-06Paper
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five2020-09-24Paper
Girth six cubic graphs have Petersen minors2020-02-26Paper
The extremal function for bipartite linklessly embeddable graphs2020-01-17Paper
Excluded minors in cubic graphs2019-07-17Paper
\(K_{6}\) minors in 6-connected graphs of bounded tree-width2019-06-17Paper
https://portal.mardi4nfdi.de/entity/Q46338182019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46339322019-05-06Paper
Excluding subdivisions of bounded degree graphs2018-12-20Paper
Hyperbolic families and coloring graphs on surfaces2018-12-05Paper
The extremal functions for triangle-free graphs with excluded minors2018-11-15Paper
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk2018-07-24Paper
Non-embeddable extensions of embedded minors2018-05-09Paper
\(K_{6}\) minors in large 6-connected graphs2018-02-09Paper
A new proof of the flat wall theorem2018-02-09Paper
Four Edge-Independent Spanning Trees2018-01-22Paper
Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two2017-11-28Paper
Cyclically five-connected cubic graphs2017-05-26Paper
Non-planar extensions of subdivisions of planar graphs2016-10-12Paper
Deploying Robots With Two Sensors inK1, 6-Free Graphs2016-08-12Paper
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.2016-06-03Paper
Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.2016-04-21Paper
Three-edge-colouring doublecross cubic graphs2016-04-21Paper
Odd \(K_{3,3}\) subdivisions in bipartite graphs2016-03-14Paper
Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs2015-03-05Paper
Three-coloring triangle-free planar graphs in linear time2014-09-09Paper
https://portal.mardi4nfdi.de/entity/Q54199582014-06-11Paper
Testing first-order properties for subclasses of sparse graphs2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q28573212013-11-01Paper
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs2013-10-10Paper
Six-Critical Graphs on the Klein Bottle2013-06-28Paper
Five-coloring graphs on the Klein bottle2012-10-19Paper
Nested cycles in large triangulations and crossing-critical graphs2012-03-19Paper
Packing directed circuits exactly2012-02-13Paper
Color-critical graphs have logarithmic circumference2011-07-08Paper
Large non-planar graphs and an application to crossing-critical graphs2011-03-14Paper
Minor-Minimal Planar Graphs of Even Branch-Width2011-01-17Paper
Voting in Agreeable Societies2010-12-01Paper
\(K_{4}\)-free graphs with no odd holes2010-04-21Paper
Pfaffian labelings and signs of edge colorings2008-10-21Paper
Coloring even-faced graphs in the torus and the Klein bottle2008-10-21Paper
The extremal function for 3-linked graphs2008-10-07Paper
Minimally non-Pfaffian graphs2008-10-07Paper
Coloring Triangle-Free Graphs on Surfaces2008-05-27Paper
Generating bricks2007-08-20Paper
The circular chromatic index of flower snarks2007-03-12Paper
The strong perfect graph theorem2007-01-04Paper
https://portal.mardi4nfdi.de/entity/Q54910202006-09-26Paper
Proper minor-closed families are small2006-08-16Paper
Minimal bricks2006-07-12Paper
The extremal function for \(K_{9}\) minors2006-04-28Paper
Independent sets in triangle-free cubic planar graphs2006-04-28Paper
Generation of simple quadrangulations of the sphere2006-01-10Paper
Hamilton paths in toroidal graphs2005-08-05Paper
An improved linear edge bound for graph linkages2005-03-08Paper
Three-coloring Klein bottle graphs of girth five2004-10-01Paper
On possible counterexamples to Negami's planar cover conjecture2004-08-04Paper
Progress on perfect graphs2003-09-01Paper
Directed tree-width2002-12-10Paper
Generating internally four-connected graphs2002-12-10Paper
Large induced forests in sparse graphs2002-06-03Paper
A new proof of the independence ratio of triangle-free cubic graphs2002-03-29Paper
Excluding Minors in Nonplanar Graphs of Girth at Least Five2001-10-16Paper
https://portal.mardi4nfdi.de/entity/Q45270072001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q42636622000-11-29Paper
Clique minors in graphs and their complements2000-06-25Paper
Excluding a countable clique2000-05-04Paper
Permanents, Pfaffian orientations, and even directed circuits2000-03-23Paper
List edge-colorings of series-parallel graphs1999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q42285121999-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42141161999-03-18Paper
The four-colour theorem1998-03-16Paper
Packing directed circuits1998-01-11Paper
Tutte's edge-colouring conjecture1997-10-20Paper
Five-connected toroidal graphs are Hamiltonian1997-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43408791997-06-15Paper
https://portal.mardi4nfdi.de/entity/Q52845791997-05-28Paper
https://portal.mardi4nfdi.de/entity/Q56890121997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48946191996-11-25Paper
Sachs' linkless embedding conjecture1996-02-20Paper
Hadwiger's conjecture for \(K_ 6\)-free graphs1996-01-18Paper
Excluding infinite clique minors1995-12-11Paper
Kuratowski chains1995-09-20Paper
Petersen family minors1995-09-20Paper
Quickly excluding a planar graph1995-03-02Paper
On the genus of a random graph1995-02-09Paper
4-connected projective planar graphs are Hamiltonian1994-12-01Paper
Planar Separators1994-10-10Paper
Call routing and the ratcatcher1994-08-11Paper
Graph searching and a min-max theorem for tree-width1994-06-30Paper
https://portal.mardi4nfdi.de/entity/Q42738381994-01-06Paper
https://portal.mardi4nfdi.de/entity/Q42738691994-01-06Paper
Linkless embeddings of graphs in 3-space1993-06-29Paper
Excluding Infinite Trees1993-05-16Paper
Monochromatic vs multicolored paths1993-04-01Paper
On the complexity of finding iso- and other morphisms for partial \(k\)- trees1993-01-17Paper
Excluding Subdivisions of Infinite Cliques1993-01-16Paper
Typical subgraphs of 3- and 4-connected graphs1993-01-01Paper
Analyzing Nash-Williams' partition theorem by means of ordinal types1992-09-27Paper
Excluding infinite minors1992-09-27Paper
An end-faithful spanning tree counterexample1992-09-27Paper
An End-Faithful Spanning Tree Counterexample1992-06-27Paper
Quickly excluding a forest1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39727531992-06-26Paper
On the orientable genus of graphs embedded in the klein bottle1992-06-26Paper
Clique-sums, tree-decompositions and compactness1992-06-25Paper
A Separator Theorem for Nonplanar Graphs1992-06-25Paper
The Menger-like property of the three-width of infinite graphs1991-01-01Paper
Algorithms finding tree-decompositions of graphs1991-01-01Paper
On well-quasi-ordering finite structures with labels1990-01-01Paper
A Menger-like property of tree-width: The finite case1990-01-01Paper
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor1989-01-01Paper
A counter-example to ‘Wagner's conjecture’ for infinite graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38215801988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37722011987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37808711987-01-01Paper
Graphs without \(K_ 4\) and well-quasi-ordering1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426151985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374471985-01-01Paper
A Combinatorial Construction of a Nonmeasurable Set1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37014651984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Robin Thomas