Robin Thomas

Q: What Schools Are Affiliated With Robin Thomas

Robin Thomas is affiliated with the following schools: Charles University, Princeton University, Stanford University, Georgia Tech

Robin Thomas 's AcademicInfluence.com Rankings

Robin Thomas

Mathematics

#616

World Rank

#1148

Historical Rank

#271

USA Rank

Measure Theory

#2669

World Rank

#3192

Historical Rank

#771

USA Rank

mathematics Degrees

Download Badge

Mathematics

Robin Thomas 's Degrees

PhD Mathematics Princeton University

Why Is Robin Thomas Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robin Thomas was a mathematician working in graph theory at the Georgia Institute of Technology. Thomas received his doctorate in 1985 from Charles University in Prague, Czechoslovakia , under the supervision of Jaroslav Nešetřil. He joined the faculty at Georgia Tech in 1989, and became a Regents' Professor there, briefly serving as the department Chair.

(See a Problem?)

Robin Thomas 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Four-Colour Theorem (1997) (606)
The Strong Perfect Graph Theorem (2002) (598)
Quickly Excluding a Planar Graph (1994) (444)
Graph Searching and a Min-Max Theorem for Tree-Width (1993) (411)
Call routing and the ratcatcher (1994) (334)
Hadwiger's conjecture forK6-free graphs (1993) (288)
Directed Tree-Width (2001) (277)
PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS (1999) (240)
A separator theorem for graphs with an excluded minor and its applications (1990) (213)
A separator theorem for nonplanar graphs (1990) (213)
Sachs' Linkless Embedding Conjecture (1995) (199)
On the complexity of finding iso- and other morphisms for partial k-trees (1992) (170)
Packing directed circuits (1996) (167)
A new proof of the four-colour theorem (1996) (159)
4-Connected Projective-Planar Graphs Are Hamiltonian (1994) (155)
An improved linear edge bound for graph linkages (2005) (128)
AN UPDATE ON THE FOUR-COLOR THEOREM (1998) (116)
Quickly excluding a forest (1991) (115)
Efficiently four-coloring planar graphs (1996) (115)
Testing first-order properties for subclasses of sparse graphs (2011) (106)
Deciding First-Order Properties for Sparse Graphs (2010) (101)
Planar Separators (1994) (101)
Typical Subgraphs of 3- and 4-Connected Graphs (1993) (98)
Algorithms Finding Tree-Decompositions of Graphs (1991) (91)
Generation of simple quadrangulations of the sphere (2005) (90)
Proper minor-closed families are small (2006) (82)
A menger-like property of tree-width: The finite case (1990) (76)
Linkless embeddings of graphs in 3-space (1993) (65)
A survey of Pfaffian orientations of graphs (2006) (63)
A survey of linkless embeddings (1991) (60)
Tutte's Edge-Colouring Conjecture (1997) (59)
Progress on perfect graphs (2003) (57)
Topics in Discrete Mathematics (2006) (52)
A new proof of the independence ratio of triangle-free cubic graphs (2001) (50)
The extremal function for K9 minors (2006) (48)
Large induced forests in sparse graphs (2001) (44)
Well-quasi-ordering infinite graphs with forbidden finite planar minor (1989) (43)
Permanents, Pfaffian orientations, and even directed circuits (extended abstract) (1997) (41)
Independent sets in triangle-free cubic planar graphs (2006) (40)
Three-coloring triangle-free planar graphs in linear time (2009) (40)
K4-free graphs with no odd holes (2010) (39)
Surveys in Combinatorics, 1999: Recent Excluded Minor Theorems for Graphs (1999) (38)
Five-Connected Toroidal Graphs Are Hamiltonian (1997) (37)
List Edge-Colorings of Series-Parallel Graphs (1999) (36)
A counter-example to ‘Wagner's conjecture’ for infinite graphs (1988) (35)
Generating bricks (2007) (33)
Packing directed circuits exactly (2010) (28)
Hamilton paths in toroidal graphs (2005) (28)
Three-coloring Klein bottle graphs of girth five (2004) (28)
Voting in Agreeable Societies (2008) (26)
An end-faithful spanning tree counterexample (1991) (26)
Excluding infinite minors (1991) (25)
A new proof of the flat wall theorem (2012) (24)
Hyperbolic families and coloring graphs on surfaces (2016) (23)
Tree decompositions of graphs (1996) (23)
Coloring planar graphs with triangles far apart (2009) (22)
Petersen Family Minors (1995) (22)
Coloring Triangle-Free Graphs on Surfaces (2007) (22)
Excluding subdivisions of infinite cliques (1992) (20)
Generating Internally Four-Connected Graphs (2002) (20)
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations (2015) (19)
Ordinal Types in Ramsey Theory and Well-Partial-Ordering Theory (1990) (19)
Uniqueness of highly representative surface embeddings (1996) (19)
Monochromatic Vs multicolored paths (1992) (19)
Deploying Robots With Two Sensors in K1, 6‐Free Graphs (2013) (19)
Graph Planarity and Related Topics (1999) (18)
The Circular Chromatic Index of Flower Snarks (2006) (18)
On the orientable genus of graphs embedded in the klein bottle (1991) (18)
On polynomial time decidability of induced-minor-closed classes (1988) (17)
A note on spatial representation of graphs (1985) (16)
Clique-sums, tree-decompositions and compactness (1990) (16)
Minimally non-Pfaffian graphs (2008) (16)
The extremal function for 3-linked graphs (2008) (16)
On well-quasi-ordering finite structures with labels (1990) (16)
On possible counterexamples to Negami's planar cover conjecture (2004) (16)
Kuratowski Chains (1995) (16)
Excluding a Countable Clique (1999) (15)
Excluding Infinite Clique Minors (1995) (15)
Arrangeability and Clique Subdivisions (2013) (14)
The menger-like property of the tree-width of infinite graphs (1991) (14)
Non-Planar Extensions Of Planar Graphs (1999) (13)
Five-coloring graphs on the Klein bottle (2012) (13)
Cyclically five-connected cubic graphs (2015) (13)
Three-edge-colouring doublecross cubic graphs (2014) (13)
Recent Excluded Minor Theorems (13)
Minimal bricks (2019) (12)
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies (2009) (12)
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs (2014) (11)
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five (2014) (11)
A Combinatorial Construction of a Nonmeasurable Set (1985) (10)
Spanning paths in infinite planar graphs (1996) (10)
Graphs without K4 and well-quasi-ordering (1985) (10)
Excluding A Grid Minor In Planar Digraphs (2015) (10)
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (2009) (10)
Excluded minors in cubic graphs (2014) (9)
Excluding infinite trees (1993) (9)
Large non-planar graphs and an application to crossing-critical graphs (2009) (9)
K6 minors in large 6-connected graphs (2012) (9)
Quickly excluding a non-planar graph (2020) (9)
Excluding subdivisions of bounded degree graphs (2014) (9)
Coloring even-faced graphs in the torus and the Klein bottle (2008) (9)
On the Genus of a Random Graph (1995) (8)
Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk (2013) (8)
List-coloring apex-minor-free graphs (2014) (7)
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk (2015) (7)
Nested cycles in large triangulations and crossing-critical graphs (2009) (7)
K_6 minors in 6-connected graphs of bounded tree-width (2012) (7)
Excluding Minors in Nonplanar Graphs of Girth at Least Five (2000) (7)
The TreeWidth Compactness Theorem for Hypergraphs (1988) (6)
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (2014) (6)
Non-planar extensions of subdivisions of planar graphs (2014) (6)
Pfaffian labelings and signs of edge colorings (2008) (6)
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle (2010) (6)
A survey of Pfafﬁan orientations of graphs (2007) (6)
Minors of two-connected graphs of large path-width (2017) (6)
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two (2016) (5)
Four Edge-Independent Spanning Trees (2017) (5)
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm (2016) (5)
Temperely-Lieb Algebras and the Four-Color Theorem (2003) (5)
The extremal functions for triangle-free graphs with excluded minors (2018) (5)
Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation (2020) (5)
Edge-coloring series-parallel multigraphs (2011) (4)
SET INTERSECTIONS, PERFECT GRAPHS, AND VOTING IN AGREEABLE SOCIETIES (2006) (4)
Planarity in Linear Time Class Notes (1997) (3)
Girth Six Cubic Graphs Have Petersen Minors (2014) (3)
Packing cycles in undirected group-labelled graphs (2020) (3)
The Extremal Function for Bipartite Linklessly Embeddable Graphs (2017) (3)
Clique Minors in Graphs and Their Complements (2000) (3)
The Gyori-Lovasz theorem (2016) (3)
Kt Minors in Large t-Connected Graphs (2009) (3)
Color-critical graphs have logarithmic circumference (2009) (2)
Analyzing Nash-Williams' partition theorem by means of ordinal types (1991) (2)
Packing A-paths of length zero modulo a prime (2020) (2)
Odd K3, 3 subdivisions in bipartite graphs (2013) (2)
A journey through discrete mathematics : a tribute to Jiří Matoušek (2017) (2)
A Journey Through Discrete Mathematics (2017) (2)
Non-branching tree-decompositions (2017) (1)
Six-Critical Graphs on the Klein Bottle (2008) (1)
Well-quasi-ordering graphs by the topological minor relation (2014) (1)
Reducibility in the Four-Color Theorem (2014) (1)
Properties of 8-contraction-critical graphs with no K7 minor (2022) (1)
Discharging cartwheels (2014) (1)
Non-Embeddable Extensions of Embedded Minors (2014) (1)
The space of ends of pairs of disjoint paths (2017) (1)
Coloring triangle-free graphs on surfaces . Extended abstract . ∗ (2007) (1)
BRICK GENERATION (2004) (0)
Odd K 3 , 3 subdivisions in bipartite graphs 1 (2015) (0)
Graph Minors: Structure Theory and Algorithms (1996) (0)
FRG: Collaborative research: The four-color theorem and beyond (2008) (0)
On $2$-cycles of graphs. (2017) (0)
Series-parallel graphs and well- and better-quasi-orderings (1984) (0)
Pairs of disjoint cycles (2017) (0)
Six-Critical Graphs on the Klein bottle Extended Abstract (2007) (0)
Finding an Odd K3,3 (2013) (0)
Properties of 8-contraction-critical graphs with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e176" altimg="si7.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub></mml:math> minor (2023) (0)
EIDMA MINICOURSE ON STRUCTUAL GRAPH THEORY (2004) (0)
Independent sets in bounded degree graphs (2000) (0)
A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas (2019) (0)
NON-BRANCHNG TREE-DECOMPOSITIONS (2017) (0)
PFAFFIAN LABELINGS AND SIGNS OF EDGE (2005) (0)
Minor-minimal non-projective planar graphs with an internal 3-separation (2011) (0)
A New Proof of the Weak Structure Theorem (2012) (0)
On the Space of 2-Linkages. (2019) (0)
Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem (2021) (0)
Minor-Minimal Planar Graphs of Even Branch-Width (2010) (0)
Research in structural graph theory (2009) (0)
C O ] 2 O ct 2 01 5 Excluding A Grid Minor In Planar Digraphs (0)
Digraph minors and algorithms (abstract only) (2000) (0)

This paper list is powered by the following services:

Other Resources About Robin Thomas

en.wikipedia.org

What Schools Are Affiliated With Robin Thomas ?

Robin Thomas is affiliated with the following schools:

Robin Thomas 's Academic­Influence.com Rankings