Neil Robertson

What is he best known for?

The fields of study he is best known for:

• Graph theory
• Graph coloring
• Combinatorics

Neil Robertson mainly focuses on Discrete mathematics, Combinatorics, Planar graph, Graph minor and Outerplanar graph. All of his Discrete mathematics and Universal graph, Wagner graph, Complete graph, Robertson–Seymour theorem and Path graph investigations are sub-components of the entire Discrete mathematics study. Forbidden graph characterization, Complement graph, Butterfly graph, Planar straight-line graph and Polyhedral graph are subfields of Combinatorics in which his conducts study.

He has included themes like Hypergraph, Bounded function and Force-directed graph drawing in his Complement graph study. His research in Planar straight-line graph intersects with topics in Four color theorem, Five color theorem and Book embedding. His Planar graph research is multidisciplinary, incorporating elements of Line graph and Distance-hereditary graph.

His most cited work include:

• Graph minors. II: Algorithmic aspects of tree-width (1257 citations)
• Graph minors. XIII: the disjoint paths problem (1054 citations)
• Graph Minors. XX. Wagner's conjecture (622 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Planar graph, Graph minor and Forbidden graph characterization. Complement graph, Robertson–Seymour theorem, Butterfly graph, Partial k-tree and Conjecture are the core of his Discrete mathematics study. His biological study spans a wide range of topics, including Distance-regular graph and Factor-critical graph.

His work in Planar graph addresses issues such as Wagner graph, which are connected to fields such as Petersen graph. His study looks at the relationship between Graph minor and topics such as Complete graph, which overlap with Apex graph. His Forbidden graph characterization study frequently intersects with other fields, such as Universal graph.

He most often published in these fields:

• Combinatorics (96.25%)
• Discrete mathematics (86.25%)
• Planar graph (28.75%)

What were the highlights of his more recent work (between 2007-2017)?

• Combinatorics (96.25%)
• Discrete mathematics (86.25%)
• Conjecture (7.50%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Combinatorics, Discrete mathematics, Conjecture, Graph minor and Graph. In general Combinatorics study, his work on Planar graph, Wagner graph and Forbidden graph characterization often relates to the realm of Mathematical proof and Planar, thereby connecting several areas of interest. Partial k-tree, Outerplanar graph, Graph labeling and Graph coloring is closely connected to Robertson–Seymour theorem in his research, which is encompassed under the umbrella topic of Planar graph.

His studies examine the connections between Forbidden graph characterization and genetics, as well as such issues in Complement graph, with regards to Factor-critical graph, Vertex-transitive graph, Graph factorization and Bound graph. Neil Robertson works on Discrete mathematics which deals in particular with Petersen graph. His Graph research is multidisciplinary, incorporating perspectives in Chromatic scale, Graph theory and Degree.

Between 2007 and 2017, his most popular works were:

• Graph minors XXIII. Nash-Williams' immersion conjecture (118 citations)
• Graph minors. XXI. Graphs with unique linkages (49 citations)
• Graph Minors. XXII. Irrelevant vertices in linkage problems (48 citations)

In his most recent research, the most cited papers focused on:

• Graph theory
• Graph coloring
• Discrete mathematics

His scientific interests lie mostly in Discrete mathematics, Combinatorics, Graph minor, Complement graph and Forbidden graph characterization. His Graph minor study combines topics in areas such as Universal graph, Null graph and Factor-critical graph. His studies in Universal graph integrate themes in fields like Graph coloring, Graph labeling, Robertson–Seymour theorem and Planar graph.

Neil Robertson has researched Null graph in several fields, including Butterfly graph, Wagner graph, Complete graph, Apex graph and Cubic graph. His Cubic graph study frequently draws connections between adjacent fields such as Petersen graph. The Factor-critical graph study combines topics in areas such as Bound graph, Vertex-transitive graph and Graph factorization.