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.
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.
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.
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.
Graphs on Surfaces
Bojan Mohar;Carsten Thomassen.
Every Planar Graph Is 5-Choosable
Journal of Combinatorial Theory, Series B (1994)
The graph genus problem is NP-complete
Journal of Algorithms (1989)
Planarity and Duality of Finite and Infinite Graphs
Journal of Combinatorial Theory, Series B (1980)
European Journal of Combinatorics (1980)
Cycles in digraphs– a survey
Jean-Claude Bermond;Carsten Thomassen.
Journal of Graph Theory (1981)
A theorem on paths in planar graphs
Journal of Graph Theory (1983)
3-list-coloring planar graphs of girth 5
Journal of Combinatorial Theory, Series B (1995)
Reflections on graph theory
Journal of Graph Theory (1986)
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)
Journal of Graph Theory
(Impact Factor: 0.921)
If you think any of the details on this page are incorrect, let us know.
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: