- Home
- Best Scientists - Mathematics
- Robin Thomas

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Engineering and Technology
D-index
39
Citations
9,783
129
World Ranking
2712
National Ranking
1086

Mathematics
D-index
40
Citations
9,715
162
World Ranking
1349
National Ranking
612

2018 - SIAM Fellow For his contributions to structural graph theory and graph coloring, especially his work on the Four-Color Theorem and its generalizations and a proof the Strong Perfect Graph Theorem.

2013 - Fellow of the American Mathematical Society

- Combinatorics
- Graph theory
- Graph coloring

Robin Thomas mainly focuses on Combinatorics, Discrete mathematics, Planar graph, Graph minor and Outerplanar graph. His Planar straight-line graph, Bound graph, Book embedding, Forbidden graph characterization and Graph study are his primary interests in Combinatorics. His studies in Planar straight-line graph integrate themes in fields like Vertex cover and Dominating set.

Robin Thomas studied Book embedding and Polyhedral graph that intersect with Butterfly graph. The study incorporates disciplines such as Vertex, Partition and Complete graph in addition to Planar graph. His Graph factorization study deals with Strong perfect graph theorem intersecting with Perfect graph theorem and Perfect graph.

- The Strong Perfect Graph Theorem (1011 citations)
- The Four-Colour Theorem (489 citations)
- Quickly excluding a planar graph (391 citations)

Robin Thomas focuses on Combinatorics, Discrete mathematics, Graph, Planar graph and Forbidden graph characterization. Combinatorics connects with themes related to Bounded function in his study. 1-planar graph, Bound graph, Graph power, Complement graph and Cubic graph are the subjects of his Discrete mathematics studies.

His 1-planar graph research integrates issues from Indifference graph and Pathwidth. His work on Vertex is typically connected to Planar as part of general Graph study, connecting several disciplines of science. His biological study spans a wide range of topics, including List coloring, Book embedding, General theorem, Planar straight-line graph and Lemma.

- Combinatorics (92.23%)
- Discrete mathematics (56.99%)
- Graph (29.02%)

- Combinatorics (92.23%)
- Graph (29.02%)
- Vertex (8.29%)

Combinatorics, Graph, Vertex, Disjoint sets and Planar graph are his primary areas of study. His Combinatorics research is multidisciplinary, incorporating elements of Embedding and Bounded function. His work on Vertex as part of his general Graph study is frequently connected to Subdivision, Brick and Bounding overwatch, thereby bridging the divide between different branches of science.

His research investigates the link between Vertex and topics such as Graph minor that cross with problems in Time complexity. His Vertex study combines topics in areas such as Independent spanning trees, Outerplanar graph and Spanning tree. His research investigates the connection between Spanning tree and topics such as Graph theory that intersect with problems in Discrete mathematics.

- Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies (21 citations)
- K6 MINORS IN LARGE 6-CONNECTED GRAPHS (20 citations)
- K6 MINORS IN 6-CONNECTED GRAPHS OF BOUNDED TREE-WIDTH (15 citations)

- Combinatorics
- Graph theory
- Graph coloring

Robin Thomas mainly investigates Combinatorics, Graph, Planar graph, Bounded function and Vertex. His Existential quantification, Cubic graph, Conjecture, Absolute constant and Girth investigations are all subjects of Combinatorics research. Robin Thomas has included themes like Disjoint sets, Edge and Matching in his Cubic graph study.

His Graph study combines topics from a wide range of disciplines, such as Structure, Surface and Genus. Planar graph is the subject of his research, which falls under Discrete mathematics. His studies deal with areas such as Petersen graph, Embedding and Partition as well as Vertex.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

The Strong Perfect Graph Theorem

Maria Chudnovsky;Neil Robertson;Paul Douglas Seymour;Robin Thomas.

Annals of Mathematics **(2006)**

1419 Citations

The Strong Perfect Graph Theorem

Maria Chudnovsky;Neil Robertson;Paul Douglas Seymour;Robin Thomas.

Annals of Mathematics **(2006)**

1419 Citations

The Four-Colour Theorem

Neil Robertson;Daniel Sanders;Paul Seymour;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1997)**

959 Citations

The Four-Colour Theorem

Neil Robertson;Daniel Sanders;Paul Seymour;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1997)**

959 Citations

Graph searching and a min-max theorem for tree-width

P. D. Seymour;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1993)**

514 Citations

Graph searching and a min-max theorem for tree-width

P. D. Seymour;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1993)**

514 Citations

Quickly excluding a planar graph

Neil Robertson;Paul Seymour;Robin Thomas;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1994)**

491 Citations

Quickly excluding a planar graph

Neil Robertson;Paul Seymour;Robin Thomas;Robin Thomas.

Journal of Combinatorial Theory, Series B **(1994)**

491 Citations

Call routing and the ratcatcher

Paul Douglas Seymour;R. Thomas.

Combinatorica **(1994)**

426 Citations

Call routing and the ratcatcher

Paul Douglas Seymour;R. Thomas.

Combinatorica **(1994)**

426 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Princeton University

The Ohio State University

National Institute of Informatics

Tel Aviv University

Charles University

Princeton University

Charles University

University of California, Irvine

Emory University

Charles University

Carnegie Mellon University

Georgia Institute of Technology

University of Ulster

Monash University

University of Science and Technology Beijing

University of Aveiro

Cargill (United States)

Plantstress.com

Spanish National Research Council

Brigham and Women's Hospital

Universitat Politècnica de Catalunya

Italian Institute of Technology

University of Western Ontario

Norwegian Institute of Public Health

Universidade de São Paulo

California Institute of Technology

Something went wrong. Please try again later.