What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- The Strong Perfect Graph Theorem (1011 citations)
- The Four-Colour Theorem (489 citations)
- Quickly excluding a planar graph (391 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (92.23%)
- Discrete mathematics (56.99%)
- Graph (29.02%)
What were the highlights of his more recent work (between 2016-2020)?
- Combinatorics (92.23%)
- Graph (29.02%)
- Vertex (8.29%)
In recent papers he was focusing on the following fields of study:
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.
Between 2016 and 2020, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
