D-Index & Metrics Best Publications

D-Index & Metrics

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
Computer Science D-index 61 Citations 11,614 213 World Ranking 1458 National Ranking 6
Mathematics D-index 62 Citations 11,785 222 World Ranking 225 National Ranking 2

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Graph theory
  • Graph coloring

Carsten Thomassen mainly investigates Combinatorics, Discrete mathematics, Planar graph, Forbidden graph characterization and Graph minor. Combinatorics is represented through his Universal graph, Cubic graph, Outerplanar graph, Graph power and Conjecture research. Carsten Thomassen interconnects Petersen graph and Edge coloring in the investigation of issues within Cubic graph.

His is involved in several facets of Discrete mathematics study, as is seen by his studies on Pancyclic graph, Voltage graph, Natural number, Kuratowski's theorem and Chordal graph. In his work, Polyhedral graph is strongly intertwined with Steinitz's theorem, which is a subfield of Kuratowski's theorem. His work investigates the relationship between Planar graph and topics such as Robertson–Seymour theorem that intersect with problems in Fáry's theorem and Nowhere-zero flow.

His most cited work include:

  • Graphs on Surfaces (928 citations)
  • Every Planar Graph Is 5-Choosable (419 citations)
  • The graph genus problem is NP-complete (219 citations)

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

Carsten Thomassen spends much of his time researching Combinatorics, Discrete mathematics, Graph, Planar graph and Conjecture. Cubic graph, Forbidden graph characterization, Hamiltonian path, Complement graph and Pancyclic graph are the core of his Combinatorics study. Line graph, Graph power, Outerplanar graph, Graph minor and Chordal graph are among the areas of Discrete mathematics where the researcher is concentrating his efforts.

His research integrates issues of Chromatic scale and Existential quantification in his study of Graph. His Planar graph study integrates concerns from other disciplines, such as Butterfly graph, Planar straight-line graph and Polyhedral graph. His studies in Conjecture integrate themes in fields like Digraph, Natural number and Counterexample.

He most often published in these fields:

  • Combinatorics (97.50%)
  • Discrete mathematics (71.25%)
  • Graph (17.08%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (97.50%)
  • Planar graph (16.67%)
  • Discrete mathematics (71.25%)

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

Carsten Thomassen focuses on Combinatorics, Planar graph, Discrete mathematics, Graph and Planar. His work in Conjecture, Bipartite graph, Vertex, Hamiltonian path and Chromatic polynomial is related to Combinatorics. His study in Planar graph is interdisciplinary in nature, drawing from both Group, Forbidden graph characterization, Exponential growth, Planar straight-line graph and Abelian group.

His study focuses on the intersection of Forbidden graph characterization and fields such as Graph minor with connections in the field of Cubic graph. His study in Neighbourhood, Trémaux tree, Pathwidth, 1-planar graph and Outerplanar graph are all subfields of Discrete mathematics. His Graph study combines topics from a wide range of disciplines, such as Golden ratio, Natural number, Chromatic scale, Upper and lower bounds and If and only if.

Between 2015 and 2021, his most popular works were:

  • Decomposing graphs into a constant number of locally irregular subgraphs (19 citations)
  • The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture (19 citations)
  • The square of a planar cubic graph is 7-colorable (16 citations)

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

  • Combinatorics
  • Graph theory
  • Topology

His primary areas of study are Combinatorics, Conjecture, Discrete mathematics, Graph and Natural number. His study in Planar graph, Modulo and Bipartite graph is done as part of Combinatorics. His Planar graph research includes elements of Planar straight-line graph, Chromatic polynomial, Group and Edge.

All of his Discrete mathematics and Hamiltonian path, Pancyclic graph and Trémaux tree investigations are sub-components of the entire Discrete mathematics study. His work carried out in the field of Pancyclic graph brings together such families of science as Indifference graph, Independent set and Graph toughness. His Natural number research incorporates themes from Neighbourhood, Connectivity, Strongly connected component and NP-complete.

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.

Best Publications

Graphs on Surfaces

Bojan Mohar;Carsten Thomassen.
(2001)

1475 Citations

Every Planar Graph Is 5-Choosable

C. Thomassen.
Journal of Combinatorial Theory, Series B (1994)

563 Citations

The graph genus problem is NP-complete

C. Thomassen.
Journal of Algorithms (1989)

315 Citations

Planarity and Duality of Finite and Infinite Graphs

Carsten Thomassen.
Journal of Combinatorial Theory, Series B (1980)

262 Citations

2-Linked Graphs

Carsten Thomassen.
European Journal of Combinatorics (1980)

257 Citations

Cycles in digraphs– a survey

Jean-Claude Bermond;Carsten Thomassen.
Journal of Graph Theory (1981)

231 Citations

A theorem on paths in planar graphs

Carsten Thomassen.
Journal of Graph Theory (1983)

202 Citations

3-list-coloring planar graphs of girth 5

Carsten Thomassen.
Journal of Combinatorial Theory, Series B (1995)

195 Citations

Reflections on graph theory

Carsten Thomassen.
Journal of Graph Theory (1986)

191 Citations

Highly Connected Sets and the Excluded Grid Theorem

Reinhard Diestel;Tommy R. Jensen;Konstantin Yu. Gorbunov;Carsten Thomassen.
Journal of Combinatorial Theory, Series B (1999)

186 Citations

Editorial Boards

Journal of Graph Theory
(Impact Factor: 0.921)

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

Contact us

Best Scientists Citing Carsten Thomassen

Ken-ichi Kawarabayashi

Ken-ichi Kawarabayashi

National Institute of Informatics

Publications: 140

Bojan Mohar

Bojan Mohar

Simon Fraser University

Publications: 126

Robin Thomas

Robin Thomas

Georgia Institute of Technology

Publications: 74

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 63

Dimitrios M. Thilikos

Dimitrios M. Thilikos

National and Kapodistrian University of Athens

Publications: 59

David R. Wood

David R. Wood

Monash University

Publications: 50

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 44

Daniela Kühn

Daniela Kühn

University of Birmingham

Publications: 40

Deryk Osthus

Deryk Osthus

University of Birmingham

Publications: 38

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 36

Stephen G. Kobourov

Stephen G. Kobourov

University of Arizona

Publications: 36

Xuding Zhu

Xuding Zhu

Zhejiang Normal University

Publications: 31

Paul Seymour

Paul Seymour

Princeton University

Publications: 29

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 29

Noga Alon

Noga Alon

Tel Aviv University

Publications: 29

Bruce Reed

Bruce Reed

McGill University

Publications: 29

Something went wrong. Please try again later.