Carsten Thomassen

Carsten Thomassen 's AcademicInfluence.com Rankings

Carsten Thomassen

Mathematics

#1310

World Rank

#2189

Historical Rank

Graph Theory

#20

World Rank

#27

Historical Rank

Measure Theory

#771

World Rank

#1030

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Carsten Thomassen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Carsten Thomassen is a Danish mathematician. He has been a Professor of Mathematics at the Technical University of Denmark since 1981, and since 1990 a member of the Royal Danish Academy of Sciences and Letters. His research concerns discrete mathematics and more specifically graph theory.

(See a Problem?)

Carsten Thomassen 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Graphs on Surfaces (2001) (1209)
Every Planar Graph Is 5-Choosable (1994) (513)
The Graph Genus Problem is NP-Complete (1989) (253)
2-Linked Graphs (1980) (228)
Planarity and duality of finite and infinite graphs (1980) (184)
Cycles in digraphs- a survey (1981) (183)
Reflections on graph theory (1986) (170)
Highly Connected Sets and the Excluded Grid Theorem (1999) (160)
A theorem on paths in planar graphs (1983) (156)
3-List-Coloring Planar Graphs of Girth 5 (1995) (146)
Nowhere-zero 3-flows and modulo k-orientations (2013) (144)
The weak 3-flow conjecture and the weak circular flow conjecture (2012) (139)
Interval representations of planar graphs (1986) (130)
Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface (1991) (129)
On the Complexity of Some Colorful Problems Parameterized by Treewidth (2007) (128)
Embeddings of graphs with no short noncontractible cycles (1990) (125)
Hamiltonian-connected tournaments (1980) (123)
The Jordan-Scho¨nflies theorem and the classification of surfaces (1992) (116)
Distances in orientations of graphs (1975) (116)
Color-Critical Graphs on a Fixed Surface (1997) (116)
Nonseparating cycles in K-Connected graphs (1981) (113)
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane (1994) (108)
The Zero-Free Intervals for Chromatic Polynomials of Graphs (1997) (107)
On the presence of disjoint subgraphs of a specified type (1988) (103)
Rectilinear drawings of graphs (1988) (100)
Vertex-Transitive Graphs and Accessibility (1993) (99)
Five-Coloring Maps on Surfaces (1993) (96)
Kuratowski's theorem (1981) (96)
Girth in graphs (1983) (94)
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number (1989) (92)
The even cycle problem for directed graphs (1992) (84)
A short list color proof of Grötzsch's theorem (2003) (83)
Path and cycle sub-ramsey numbers and an edge-colouring conjecture (1986) (83)
Non-separating induced cycles in graphs (1981) (82)
Coloring graphs with fixed genus and girth (1997) (81)
RELATIONS BETWEEN CROSSING NUMBERS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS (1997) (81)
Sign-Nonsingular Matrices and Even Cycles in Directed Graphs (1986) (78)
Resistances and currents in infinite electrical networks (1990) (75)
Disjoint cycles in digraphs (1983) (72)
Hypohamiltonian graphs and digraphs (1978) (69)
Hypohamiltonian and hypotraceable graphs (1974) (69)
On the Complexity of Finding a Minimum Cycle Cover of a Graph (1997) (68)
Intersections of curve systems and the crossing number ofC5×C5 (1995) (67)
Long Cycles in Digraphs (1981) (67)
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs (1992) (66)
Graph decomposition with constraints on the connectivity and minimum degree (1983) (66)
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree (2002) (63)
Characterization of even directed graphs (1987) (62)
Planar and infinite hypohamiltonian and hypotraceable graphs (1976) (60)
Graph decomposition with applications to subdivisions and path systems modulo k (1983) (59)
Isoperimetric Inequalities and Transient Random Walks on Graphs (1992) (57)
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5 (1999) (56)
On pancyclic digraphs (1976) (54)
Deformations of plane graphs (1983) (53)
Tight bounds on the chromatic sum of a connected graph (1989) (52)
Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments (1982) (52)
Embeddings and minors (1996) (52)
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces (1997) (51)
Five-Coloring Graphs on the Torus (1994) (50)
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture (2016) (50)
Highly connected non-2-linked digraphs (1991) (50)
Finite metric spaces of strictly negative type (1998) (49)
Even Cycles in Directed Graphs (1985) (49)
Circuits through specified edges (1982) (48)
Graph-like continua, augmenting arcs, and Menger’s theorem (2008) (46)
A short proof of Meyniel's theorem (1977) (45)
Decomposing a Planar Graph into Degenerate Graphs (1995) (45)
Claw‐decompositions and tutte‐orientations (2006) (45)
The chromatic number of a graph of girth 5 on a fixed surface (2003) (44)
The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity (2001) (44)
Edge-decompositions of highly connected graphs into paths (2008) (43)
Density Conditions For Triangles In Multipartite Graphs (2006) (42)
Planar cubic hypohamiltonian and hypotraceable graphs (1981) (42)
A nine point theorem for 3-connected graphs (1982) (42)
The square of a planar cubic graph is 7-colorable (2017) (42)
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs (1998) (41)
Minimal Graphs with Crossing Number at Least k (1993) (41)
On the Number of Hamiltonian Cycles in Bipartite Graphs (1996) (38)
Decompositions of highly connected graphs into paths of length 3 (2008) (37)
Kings in k-partite tournaments (1991) (37)
An ore-type condition implying a digraph to be pancyclic (1977) (36)
3-connected planar spaces uniquely embed in the sphere (2002) (36)
Transient Random Walks on Graphs and Metric Spaces with Applications to Hyperbolic Surfaces (1992) (35)
The chromatic polynomial and list colorings (2009) (35)
Exponentially many 5-list-colorings of planar graphs (2007) (35)
Trees in Triangulations (1994) (35)
Graphs with homeomorphically irreducible spanning trees (1990) (34)
The 2-linkage problem for acyclic digraphs (1985) (33)
Planar acyclic oriented graphs (1989) (32)
Decomposing graphs into a constant number of locally irregular subgraphs (2016) (31)
Hamiltonian Paths in Squares of Infinite Locally Finite Blocks (1978) (30)
On hypohamiltonian graphs (1974) (30)
Chords of Longest Cycles in Cubic Graphs (1997) (29)
Highly Symmetric Subgraphs of Hypercubes (1993) (29)
Some remarks on Hajo's' conjecture (2005) (29)
A remark on the factor theorems of lovász and tutte (1981) (28)
Claw-decompositions and tutte-orientations (2006) (28)
Surveys in Combinatorics: Long cycles in digraphs with constraints on the degrees (1979) (27)
Infinite, highly connected digraphs with no two arc-disjoint spanning trees (1989) (27)
Plane Cubic Graphs with Prescribed Face Areas (1992) (27)
Triangulating a Surface with a Prescribed Graph (1993) (26)
Many 3-colorings of triangle-free planar graphs (2007) (26)
Some Homeomorphism Properties of Graphs (1974) (26)
Edge-disjoint Hamiltonian cycles in hypertournaments (2006) (25)
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree (2007) (25)
Decomposing graphs into paths of fixed length (2013) (25)
When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse (1989) (25)
Infinite connected graphs with no end-preserving spanning trees (1992) (24)
On the number of hamiltonian cycles in a maximal planar graph (1979) (24)
Chromatic Roots and Hamiltonian Paths (2000) (24)
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs (1992) (23)
On the maximum number of cycles in a planar graph (2008) (23)
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph (2001) (22)
Graphs in which every finite path is contained in a circuit (1973) (22)
Long Cycles in Graphs on a Fixed Surface (2002) (22)
Spanning trees and orientations of graphs (2010) (22)
Infinite vertex-transitive, edge-transitive non-1-transitive graphs (1989) (22)
Straight Line Representations of Infinite Planar Graphs (1977) (22)
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs (1989) (22)
Decomposing a graph into bistars (2013) (21)
The Genus Problem for Cubic Graphs (1997) (20)
Strongly 2-connected orientations of graphs (2015) (20)
Strongly self-complementary and hereditarily isomorphic tournaments (1976) (20)
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number (1987) (19)
Bidirectional retracting-free double tracings and upper embeddability of graphs (1990) (19)
Antidirected Hamilton circuits and paths in tournaments (1973) (19)
On the number of Hamiltonian cycles in tournaments (1991) (19)
The Even Cycle Problem for Planar Digraphs (1993) (18)
Hamilton Circuits in Regular Tournaments (1985) (18)
The Hadwiger number of infinite vertex-transitive graphs (1992) (17)
Hamiltonian dicycles avoiding prescribed arcs in tournaments (1987) (17)
Coloring triangle-free graphs with fixed size (2000) (17)
Graph factors modulo k (2014) (17)
On the Number of Cycles in 3-Connected Cubic Graphs (1997) (16)
The color space of a graph (2000) (16)
Duality of infinite graphs (1982) (16)
2-List-coloring planar graphs without monochromatic triangles (2008) (16)
Three-regular subgraphs of four-regular graphs (1979) (15)
Extending a perfect matching to a Hamiltonian cycle (2015) (15)
Decomposing a planar graph of girth 5 into an independent set and a forest (2009) (15)
A refinement of Kuratowski's theorem (1984) (14)
Totally Odd -subdivisions in 4-chromatic Graphs (2001) (14)
Embeddings of graphs (1994) (14)
From the plane to higher surfaces (2012) (14)
Orientations of infinite graphs with prescribed edge-connectivity (2016) (13)
Counterexamples to the edge reconstruction conjecture for infinite graphs (1977) (13)
Counterexamples to Adám's conjecture on arc reversals in directed graphs (1987) (13)
Universality in minor-closed graph classes (2021) (12)
Rainbow Paths with Prescribed Ends (2011) (11)
The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space (2000) (11)
On randomly Hamiltonian graphs (1973) (11)
Cycles through all finite vertex sets in infinite graphs (2017) (11)
On the Number of Longest and Almost Longest Cycles in Cubic Graphs (2012) (10)
Totally Odd K4-subdivisions in 4-chromatic Graphs (2001) (10)
The Locally Connected Compact Metric Spaces Embeddable In The Plane (2004) (10)
Reconstructing 1-coherent locally finite trees (1978) (10)
A minimal condition implying a specialK4-subdivision in a graph (1974) (9)
On the max‐cut problem for a planar, cubic, triangle‐free graph, and the Chinese postman problem for a planar triangulation (2006) (9)
Cycles in graphs of uncountable chromatic number (1983) (9)
Hypotraceable digraphs (1980) (9)
The number of k-colorings of a graph on a fixed surface (2006) (9)
Note on circuits containing specified edges (1977) (9)
On k-Rails in Graphs (1974) (9)
Subdivisions of graphs with large minimum degree (1984) (9)
Tutte's spring theorem (2004) (9)
Graphs with not all possible path-kernels (2004) (9)
A link between the Jordan curve theorem and the Kuratowski planarity criterion (1990) (8)
The flow index and strongly connected orientations (2018) (8)
Edge sets contained in circuits (1976) (8)
A Cantor-Bernstein Theorem for Paths in Graphs (2006) (8)
Cycles in 5-connected triangulations (2020) (8)
On the Nelson Unit Distance Coloring Problem (1999) (8)
The maximum number of minimal codewords in long codes (2012) (8)
Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture (2014) (7)
Density of Chromatic Roots in Minor-Closed Graph Families (2018) (7)
On the Minimum Number of Spanning Trees in k‐Edge‐Connected Graphs (2017) (7)
Cycles through four edges in 3-connected cubic graphs (1985) (7)
Planar Ramsey graphs (2018) (6)
Graphs in which every path is contained in a Hamilton path. (1974) (6)
Chords in longest cycles (2017) (6)
Hajós' conjecture for line graphs (2007) (6)
Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs (2016) (6)
Classification Of Locally 2-Connected Compact Metric Spaces (2004) (6)
Spanning quadrangulations of triangulated surfaces (2017) (6)
K5-Subdivisions in Graphs (1996) (6)
The cover-index of infinite graphs (1980) (5)
Factorizing regular graphs (2020) (5)
Nash-Williams’ cycle-decomposition theorem (2017) (5)
On planarity of compact, locally connected, metric spaces (2009) (5)
The coverse of the Jordan Curve Theorem and a characterization of planar maps (1989) (5)
The maximum number of minimal codewords in an [n, k][n, k]-code (2013) (5)
On digraphs with no two disjoint directed cycles (1987) (5)
Grinberg's Criterion Applied to Some Non-Planar Graphs (2011) (5)
The rendezvous number of a symmetric matrix and a compact metric space (2000) (5)
Hamilton cycles in sparse locally connected graphs (2019) (5)
On separating cycles in graphs (1978) (4)
The minimum number of minimal codewords in an [n, k]-code and in graphic codes (2015) (4)
Trees, Ends, and Transience (1992) (4)
Destroying longest cycles in graphs and digraphs (2015) (4)
Transversals of circuits in the lexicographic product of directed graphs (1975) (4)
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time (2018) (4)
Switchings, extensions, and reductions in central digraphs (2011) (4)
The Jordan-Schonflies Theorem and the Classification of Surface Author ( s ) : (2010) (4)
Review: Jonathan L. Gross and Thomas W. Tucker, Topological graph theory (1988) (4)
Dirac's conjecture on K5-subdivisions (1997) (4)
Edge‐disjoint Hamiltonian cycles in hypertournaments (2006) (4)
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices (2019) (3)
Reconstructibility versus edge reconstructibility of infinite graphs (1978) (3)
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs (1978) (3)
Topological graph theory and crossing numbers (2006) (3)
The size of connected hypergraphs with prescribed covering number (1981) (3)
On the existence of certain subgraphs in infinite graphs (1974) (3)
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs (1996) (3)
Parity, cycle space, and K4-subdivisions in graphs (1999) (3)
Arc reversals in tournaments (1988) (2)
Decomposing graphs into paths of fixed length (2013) (2)
The maximum number of minimal codewords in an $[n,k]-$code (2012) (2)
Exponentially many Z5-colorings in simple planar graphs (2020) (2)
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (2021) (2)
Linear transformations of tropical matrices preserving the cyclicity index (2021) (2)
Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces” (2014) (2)
Group Connectivity and Group Coloring: Small Groups versus Large Groups (2020) (2)
A Tribute to Paul Erdős: Large α-preserving sets in infinite α-connected graphs (1990) (2)
4-regular 4-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles (2021) (2)
Quadrangulations and 4-color-critical graphs (2004) (2)
A characterization of locally finite vertex-transitive graphs (1987) (2)
A characterization of the 2-sphere in terms of Jordan curve separation (1992) (2)
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity (2016) (2)
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation (2006) (2)
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface (2020) (2)
4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles (2021) (1)
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation (2022) (1)
The number of colorings of planar graphs with no separating triangles (2017) (1)
CHROMATIC GRAPH THEORY (2001) (1)
NOR)T).~ Finite Metric Spaces of Strictly Negative Type* (1998) (1)
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (2019) (1)
Rectangular and visibility representations of infinite planar graphs (2006) (1)
Gabriel andrew dirac (1985) (1)
Cycles containing all the odd-degree vertices (2020) (1)
Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces” (2014) (0)
An intersection graph of straight lines (2002) (0)
Path matchings in infinite graphs (2003) (0)
Grinberg ’ s Criterion on Non-Planar Graphs (2008) (0)
A letter from the editors (2005) (0)
Nash-Williams’ cycle-decomposition theorem (2016) (0)
Title : On The Number of Spanning Trees, Orientations and Cycles (2012) (0)
On ‘Uniformly Filled’ Determinants (1990) (0)
Editorial (1994) (0)
Flexibility of Embeddings of a Halin Graph on the Projective Plane (2017) (0)
Infinitely connected subgraphs in graphs of uncountable chromatic number (2017) (0)
Deciding Parity of Graph Crossing Number (2018) (0)
On homeomorphically irreducible spanning trees (1990) (0)
Ádám's conjecture (2023) (0)
Infinitely connected subgraphs in graphs of uncountable chromatic number (2016) (0)
Decomposition of Graphs into Chains (1986) (0)
Spanning quadrangulations of triangulated surfaces (2017) (0)
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity (2016) (0)
Subgraphs with large degrees and girth (1985) (0)
Hypotraceable Martin Grotschel Digraphs UNIVERSKAT (2006) (0)
On the Hadwiger-Nelson unit distance coloring problem (1998) (0)
Orientations of infinite graphs with prescribed edge-connectivity (2015) (0)

This paper list is powered by the following services:

Other Resources About Carsten Thomassen

What Schools Are Affiliated With Carsten Thomassen ?

Carsten Thomassen is affiliated with the following schools:

Carsten Thomassen 's Academic­Influence.com Rankings

Why Is Carsten Thomassen Influential?

Carsten Thomassen 's Published Works

Published Works

Other Resources About Carsten Thomassen

What Schools Are Affiliated With Carsten Thomassen ?

Carsten Thomassen 's AcademicInfluence.com Rankings