On hypohamiltonian graphs. - Carsten Thomassen (Discret. Math., 1974)

Hypohamiltonian and hypotraceable graphs. - Carsten Thomassen (Discret. Math., 1974)

Planar and infinite hypohamiltonian and hypotraceable graphs. - Carsten Thomassen (Discret. Math., 1976)

A short proof of Meyniel's theorem. - J. Adrian Bondy; Carsten Thomassen (Discret. Math., 1977)

An ore-type condition implying a digraph to be pancyclic. - Carsten Thomassen (Discret. Math., 1977)

Counterexamples to the edge reconstruction conjecture for infinite graphs. - Carsten Thomassen (Discret. Math., 1977)

Note on circuits containing specified edges. - Carsten Thomassen (J. Comb. Theory B, 1977)

Reconstructibility versus edge reconstructibility of infinite graphs. - Carsten Thomassen (Discret. Math., 1978)

On separating cycles in graphs. - Carsten Thomassen (Discret. Math., 1978)

Distances in orientations of graphs. - Vasek Chvátal; Carsten Thomassen (J. Comb. Theory B, 1978)

Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs. - Carsten Thomassen (J. Graph Theory, 1978)

Three-regular subgraphs of four-regular graphs. - Vasek Chvátal; Herbert Fleischner; J. Sheehan; Carsten Thomassen (J. Graph Theory, 1979)

On the number of hamiltonian cycles in a maximal planar graph. - Seifollah Louis Hakimi; Edward F. Schmeichel; Carsten Thomassen (J. Graph Theory, 1979)

On the number of Hamiltonian cycles in tournaments. - Carsten Thomassen (Discret. Math., 1980)

2-Linked Graphs. - Carsten Thomassen (Eur. J. Comb., 1980)

Planarity and duality of finite and infinite graphs. - Carsten Thomassen (J. Comb. Theory B, 1980)

Hamiltonian-connected tournaments. - Carsten Thomassen (J. Comb. Theory B, 1980)

Hypotraceable digraphs. - Martin Grötschel; Carsten Thomassen; Yoshiko Wakabayashi (J. Graph Theory, 1980)

Planar cubic hypohamiltonian and hypotraceable graphs. - Carsten Thomassen (J. Comb. Theory B, 1981)

The size of connected hypergraphs with prescribed covering number. - Béla Bollobás; Carsten Thomassen (J. Comb. Theory B, 1981)

Non-separating induced cycles in graphs. - Carsten Thomassen; Bjarne Toft (J. Comb. Theory B, 1981)

Cycles in digraphs- a survey. - Jean-Claude Bermond; Carsten Thomassen (J. Graph Theory, 1981)

Kuratowski's theorem. - Carsten Thomassen (J. Graph Theory, 1981)

Nonseparating cycles in K-Connected graphs. - Carsten Thomassen (J. Graph Theory, 1981)

A remark on the factor theorems of lovász and tutte. - Carsten Thomassen (J. Graph Theory, 1981)

A nine point theorem for 3-connected graphs. - Derek A. Holton; Brendan D. McKay; Michael D. Plummer; Carsten Thomassen (Comb., 1982)

Circuits through specified edges. - Roland Häggkvist; Carsten Thomassen (Discret. Math., 1982)

Cycles in graphs of uncountable chromatic number. - Carsten Thomassen (Comb., 1983)

Disjoint cycles in digraphs. - Carsten Thomassen (Comb., 1983)

Girth in graphs. - Carsten Thomassen (J. Comb. Theory B, 1983)

Deformations of plane graphs. - Carsten Thomassen (J. Comb. Theory B, 1983)

Graph decomposition with constraints on the connectivity and minimum degree. - Carsten Thomassen (J. Graph Theory, 1983)

A theorem on paths in planar graphs. - Carsten Thomassen (J. Graph Theory, 1983)

Graph decomposition with applications to subdivisions and path systems modulo k. - Carsten Thomassen (J. Graph Theory, 1983)

A refinement of Kuratowski's theorem. - Carsten Thomassen (J. Comb. Theory B, 1984)

Subdivisions of graphs with large minimum degree. - Carsten Thomassen (J. Graph Theory, 1984)

The 2-linkage problem for acyclic digraphs. - Carsten Thomassen (Discret. Math., 1985)

Even Cycles in Directed Graphs. - Carsten Thomassen (Eur. J. Comb., 1985)

Cycles through four edges in 3-connected cubic graphs. - Robert E. L. Aldred; Derek A. Holton; Carsten Thomassen (Graphs Comb., 1985)

Subgraphs with large degrees and girth. - Carsten Thomassen (Graphs Comb., 1985)

Gabriel andrew dirac. - Carsten Thomassen (J. Graph Theory, 1985)

Path and cycle sub-ramsey numbers and an edge-colouring conjecture. - Gena Hahn; Carsten Thomassen (Discret. Math., 1986)

Interval representations of planar graphs. - Carsten Thomassen (J. Comb. Theory B, 1986)

Reflections on graph theory. - Carsten Thomassen (J. Graph Theory, 1986)

On digraphs with no two disjoint directed cycles. - Carsten Thomassen (Comb., 1987)

Hamiltonian dicycles avoiding prescribed arcs in tournaments. - Pierre Fraisse; Carsten Thomassen (Graphs Comb., 1987)

Characterization of even directed graphs. - Paul D. Seymour; Carsten Thomassen (J. Comb. Theory B, 1987)

A characterization of locally finite vertex-transitive graphs. - Carsten Thomassen (J. Comb. Theory B, 1987)

Counterexamples to Adám's conjecture on arc reversals in directed graphs. - Carsten Thomassen (J. Comb. Theory B, 1987)

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. - Noga Alon; Daniel J. Kleitman; Carsten Thomassen; Michael E. Saks; Paul D. Seymour (J. Graph Theory, 1987)

Arc reversals in tournaments. - Carsten Thomassen (Discret. Math., 1988)

On the presence of disjoint subgraphs of a specified type. - Carsten Thomassen (J. Graph Theory, 1988)

Rectilinear drawings of graphs. - Carsten Thomassen (J. Graph Theory, 1988)

The Graph Genus Problem is NP-Complete. - Carsten Thomassen (J. Algorithms, 1989)

Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. - Carsten Thomassen (J. Comb. Theory B, 1989)

Infinite, highly connected digraphs with no two arc-disjoint spanning trees. - Ron Aharoni; Carsten Thomassen (J. Graph Theory, 1989)

Tight bounds on the chromatic sum of a connected graph. - Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk (J. Graph Theory, 1989)

Bidirectional retracting-free double tracings and upper embeddability of graphs. - Carsten Thomassen (J. Comb. Theory B, 1990)

Resistances and currents in infinite electrical networks. - Carsten Thomassen (J. Comb. Theory B, 1990)

Embeddings of graphs with no short noncontractible cycles. - Carsten Thomassen (J. Comb. Theory B, 1990)

Graphs with homeomorphically irreducible spanning trees. - Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen (J. Graph Theory, 1990)

Highly connected non-2-linked digraphs. - Carsten Thomassen (Comb., 1991)

Kings in k-partite tournaments. - Vojislav Petrovic; Carsten Thomassen (Discret. Math., 1991)

The Hadwiger number of subgroups vertex-transitive graphs. - Carsten Thomassen (Comb., 1992)

Plane Cubic Graphs with Prescribed Face Areas. - Carsten Thomassen (Comb. Probab. Comput., 1992)

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. - Jørgen Bang-Jensen; Yannis Manoussakis; Carsten Thomassen (J. Algorithms, 1992)

Infinite connected graphs with no end-preserving spanning trees. - Carsten Thomassen (J. Comb. Theory B, 1992)

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. - Jørgen Bang-Jensen; Carsten Thomassen (SIAM J. Discret. Math., 1992)

The Even Cycle Problem for Planar Digraphs. - Carsten Thomassen (J. Algorithms, 1993)

Minimal Graphs with Crossing Number at Least k. - R. Bruce Richter; Carsten Thomassen (J. Comb. Theory B, 1993)

Five-Coloring Maps on Surfaces. - Carsten Thomassen (J. Comb. Theory B, 1993)

Triangulating a Surface with a Prescribed Graph. - Carsten Thomassen (J. Comb. Theory B, 1993)

Vertex-Transitive Graphs and Accessibility. - Carsten Thomassen; Wolfgang Woess (J. Comb. Theory B, 1993)

Embeddings of graphs. - Carsten Thomassen (Discret. Math., 1994)

Five-Coloring Graphs on the Torus. - Carsten Thomassen (J. Comb. Theory B, 1994)

Every Planar Graph Is 5-Choosable. - Carsten Thomassen (J. Comb. Theory B, 1994)

Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane. - Carsten Thomassen (J. Comb. Theory B, 1994)

Trees in Triangulations. - Carsten Thomassen (J. Comb. Theory B, 1994)

Editorial. - Carsten Thomassen; Edward R. Scheinerman (J. Graph Theory, 1994)

Intersections of Curve Systems and the Crossing Number of C5 X C5. - R. Bruce Richter; Carsten Thomassen (Discret. Comput. Geom., 1995)

Decomposing a Planar Graph into Degenerate Graphs. - Carsten Thomassen (J. Comb. Theory B, 1995)

3-List-Coloring Planar Graphs of Girth 5. - Carsten Thomassen (J. Comb. Theory B, 1995)

K5-Subdivisions in Graphs. - Carsten Thomassen (Comb. Probab. Comput., 1996)

On the Number of Hamiltonian Cycles in Bipartite Graphs. - Carsten Thomassen (Comb. Probab. Comput., 1996)

Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. - Carsten Thomassen (J. Comb. Theory B, 1996)

The Zero-Free Intervals for Chromatic Polynomials of Graphs. - Carsten Thomassen (Comb. Probab. Comput., 1997)

Dirac's conjecture on K5-subdivisions. - Carsten Thomassen (Discret. Math., 1997)

On the Number of Cycles in 3-Connected Cubic Graphs. - Robert E. L. Aldred; Carsten Thomassen (J. Comb. Theory B, 1997)

Chords of Longest Cycles in Cubic Graphs. - Carsten Thomassen (J. Comb. Theory B, 1997)

Color-Critical Graphs on a Fixed Surface. - Carsten Thomassen (J. Comb. Theory B, 1997)

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. - Carsten Thomassen (J. Comb. Theory B, 1997)

The Genus Problem for Cubic Graphs. - Carsten Thomassen (J. Comb. Theory B, 1997)

On the Complexity of Finding a Minimum Cycle Cover of a Graph. - Carsten Thomassen (SIAM J. Comput., 1997)

Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. - Carsten Thomassen (J. Comb. Theory B, 1998)

Highly Connected Sets and the Excluded Grid Theorem. - Reinhard Diestel; Tommy R. Jensen; Konstantin Yu. Gorbunov; Carsten Thomassen (J. Comb. Theory B, 1999)

Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. - Carsten Thomassen (J. Comb. Theory B, 1999)

Coloring triangle-free graphs with fixed size. - John Gimbel; Carsten Thomassen (Discret. Math., 2000)

Chromatic Roots and Hamiltonian Paths. - Carsten Thomassen (J. Comb. Theory B, 2000)

The color space of a graph. - Tommy R. Jensen; Carsten Thomassen (J. Graph Theory, 2000)

The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space. - Carsten Thomassen (Am. Math. Mon., 2000)

Graphs on Surfaces. - Bojan Mohar; Carsten Thomassen (Johns Hopkins University Press, 2001)

The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. - Carsten Thomassen (Comb., 2001)

Totally Odd K4-subdivisions in 4-chromatic Graphs. - Carsten Thomassen (Comb., 2001)

Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. - Carsten Thomassen (J. Comb. Theory B, 2001)

On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. - Carsten Thomassen (Comb., 2002)

An intersection graph of straight lines. - Carsten Thomassen (Discret. Math., 2002)

Long Cycles in Graphs on a Fixed Surface. - Thomas Böhme 001; Bojan Mohar; Carsten Thomassen (J. Comb. Theory B, 2002)

A short list color proof of Grötzsch's theorem. - Carsten Thomassen (J. Comb. Theory B, 2003)

The chromatic number of a graph of girth 5 on a fixed surface. - Carsten Thomassen (J. Comb. Theory B, 2003)

The Locally Connected Compact Metric Spaces Embeddable In The Plane. - Carsten Thomassen (Comb., 2004)

Classification Of Locally 2-Connected Compact Metric Spaces. - Carsten Thomassen (Comb., 2004)

Graphs with not all possible path-kernels. - Robert E. L. Aldred; Carsten Thomassen (Discret. Math., 2004)

Tutte's spring theorem. - Carsten Thomassen (J. Graph Theory, 2004)

Some remarks on Hajo's' conjecture. - Carsten Thomassen (J. Comb. Theory B, 2005)

Density Conditions For Triangles In Multipartite Graphs. - J. Adrian Bondy; Jian Shen; Stéphan Thomassé; Carsten Thomassen (Comb., 2006)

The number of k-colorings of a graph on a fixed surface. - Carsten Thomassen (Discret. Math., 2006)

Claw-decompositions and tutte-orientations. - János Barát; Carsten Thomassen (J. Graph Theory, 2006)

Edge-disjoint Hamiltonian cycles in hypertournaments. - Vojislav Petrovic; Carsten Thomassen (J. Graph Theory, 2006)

Rectangular and visibility representations of infinite planar graphs. - Carsten Thomassen (J. Graph Theory, 2006)

On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. - Carsten Thomassen (J. Graph Theory, 2006)

A Cantor-Bernstein Theorem for Paths in Graphs. - Reinhard Diestel; Carsten Thomassen (Am. Math. Mon., 2006)

On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. - Carsten Thomassen (Comb., 2007)

Hajós' conjecture for line graphs. - Carsten Thomassen (J. Comb. Theory B, 2007)

Many 3-colorings of triangle-free planar graphs. - Carsten Thomassen (J. Comb. Theory B, 2007)

Exponentially many 5-list-colorings of planar graphs. - Carsten Thomassen (J. Comb. Theory B, 2007)

Graph-like continua, augmenting arcs, and Menger's theorem. - Carsten Thomassen; Antoine Vella (Comb., 2008)

2-List-coloring planar graphs without monochromatic triangles. - Carsten Thomassen (J. Comb. Theory B, 2008)

On the maximum number of cycles in a planar graph. - Robert E. L. Aldred; Carsten Thomassen (J. Graph Theory, 2008)

Decompositions of highly connected graphs into paths of length 3. - Carsten Thomassen (J. Graph Theory, 2008)

Decomposing a planar graph of girth 5 into an independent set and a forest. - Ken-ichi Kawarabayashi; Carsten Thomassen (J. Comb. Theory B, 2009)

The chromatic polynomial and list colorings. - Carsten Thomassen (J. Comb. Theory B, 2009)

Grinberg's Criterion Applied to Some Non-Planar Graphs. - Gek Ling Chia; Carsten Thomassen (Ars Comb., 2011)

On planarity of compact, locally connected, metric spaces. - R. Bruce Richter; Brendan Rooney; Carsten Thomassen (Comb., 2011)

Rainbow Paths with Prescribed Ends. - Meysam Alishahi; Ali Taherkhani; Carsten Thomassen (Electron. J. Comb., 2011)

On the complexity of some colorful problems parameterized by treewidth. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Stefan Szeider; Carsten Thomassen (Inf. Comput., 2011)

Switchings, extensions, and reductions in central digraphs. - André Kündgen; Gregor Leander; Carsten Thomassen (J. Comb. Theory A, 2011)

On the Number of Longest and Almost Longest Cycles in Cubic Graphs. - Gek Ling Chia; Carsten Thomassen (Ars Comb., 2012)

The maximum number of minimal codewords in an $[n,k]-$code - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (CoRR, 2012)

From the plane to higher surfaces. - Ken-ichi Kawarabayashi; Carsten Thomassen (J. Comb. Theory B, 2012)

The weak 3-flow conjecture and the weak circular flow conjecture. - Carsten Thomassen (J. Comb. Theory B, 2012)

Decomposing graphs into paths of fixed length. - Carsten Thomassen (Comb., 2013)

The maximum number of minimal codewords in long codes. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (Discret. Appl. Math., 2013)

The maximum number of minimal codewords in an [n, k][n, k]-code. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Patrick Solé; Carsten Thomassen (Discret. Math., 2013)

Nowhere-zero 3-flows and modulo k-orientations. - László Miklós Lovász; Carsten Thomassen; Yezhou Wu; Cun-Quan Zhang (J. Comb. Theory B, 2013)

Decomposing a graph into bistars. - Carsten Thomassen (J. Comb. Theory B, 2013)

Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". - R. Bruce Richter; Brendan Rooney; Carsten Thomassen (Comb., 2014)

Graph factors modulo k. - Carsten Thomassen (J. Comb. Theory B, 2014)

Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture. - Carsten Thomassen (J. Comb. Theory B, 2014)

Destroying longest cycles in graphs and digraphs. - Susan A. van Aardt; Alewyn P. Burger; Jean E. Dunbar; Marietjie Frick; Bernardo Llano; Carsten Thomassen; Rita Zuazua (Discret. Appl. Math., 2015)

The minimum number of minimal codewords in an [n, k]-code and in graphic codes. - Adel Alahmadi; Robert E. L. Aldred; Romar dela Cruz; Seongmin Ok; Patrick Solé; Carsten Thomassen (Discret. Appl. Math., 2015)

Extending a perfect matching to a Hamiltonian cycle. - Adel Alahmadi; Robert E. L. Aldred; Ahmad Alkenani; Rola Hijazi; Patrick Solé; Carsten Thomassen (Discret. Math. Theor. Comput. Sci., 2015)

Strongly 2-connected orientations of graphs. - Carsten Thomassen (J. Comb. Theory B, 2015)

Orientations of infinite graphs with prescribed edge-connectivity. - Carsten Thomassen (Comb., 2016)

Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. - Seongmin Ok; R. Bruce Richter; Carsten Thomassen (Graphs Comb., 2016)

The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. - Carsten Thomassen; Yezhou Wu; Cun-Quan Zhang (J. Comb. Theory B, 2016)

Infinitely connected subgraphs in graphs of uncountable chromatic number. - Carsten Thomassen (Comb., 2017)

Nash-Williams' cycle-decomposition theorem. - Carsten Thomassen (Comb., 2017)

Decomposing graphs into a constant number of locally irregular subgraphs. - Julien Bensmail; Martin Merker; Carsten Thomassen (Eur. J. Comb., 2017)

Cycles through all finite vertex sets in infinite graphs. - André Kündgen; Binlong Li; Carsten Thomassen (Eur. J. Comb., 2017)

The number of colorings of planar graphs with no separating triangles. - Carsten Thomassen (J. Comb. Theory B, 2017)

On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs. - Seongmin Ok; Carsten Thomassen (J. Graph Theory, 2017)

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. - Stephen Alstrup; Agelos Georgakopoulos; Eva Rotenberg; Carsten Thomassen (SODA, 2018)

Density of Chromatic Roots in Minor-Closed Graph Families. - Thomas J. Perrett; Carsten Thomassen (Comb. Probab. Comput., 2018)

The flow index and strongly connected orientations. - Jiaao Li; Carsten Thomassen; Yezhou Wu; Cun-Quan Zhang (Eur. J. Comb., 2018)

The square of a planar cubic graph is 7-colorable. - Carsten Thomassen (J. Comb. Theory B, 2018)

Chords in longest cycles. - Carsten Thomassen (J. Comb. Theory B, 2018)

Deciding Parity of Graph Crossing Number. - Petr Hlinený; Carsten Thomassen (SIAM J. Discret. Math., 2018)

Planar Ramsey Graphs. - Maria Axenovich; Ursula Schade; Carsten Thomassen; Torsten Ueckerdt (Electron. J. Comb., 2019)

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. - Klas Markström; Carsten Thomassen (CoRR, 2019)

Hamilton cycles in sparse locally connected graphs. - Susan A. van Aardt; Alewyn P. Burger; Marietjie Frick; Carsten Thomassen; Johan P. de Wet (Discret. Appl. Math., 2019)

Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. - John Gimbel; André Kündgen; Binlong Li; Carsten Thomassen (SIAM J. Discret. Math., 2019)

Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. - James Davies; Carsten Thomassen (Electron. J. Comb., 2020)

Group Connectivity and Group Coloring: Small Groups versus Large Groups. - Rikke Langhede; Carsten Thomassen (Electron. J. Comb., 2020)

Cycles in 5-connected triangulations. - Adel Alahmadi; Robert E. L. Aldred; Carsten Thomassen (J. Comb. Theory, Ser. B, 2020)

Factorizing regular graphs. - Carsten Thomassen (J. Comb. Theory B, 2020)

Cycles containing all the odd-degree vertices. - Kathie Cameron; Carsten Thomassen (J. Comb. Theory B, 2020)

Exponentially many Z5-colorings in simple planar graphs. - Rikke Langhede; Carsten Thomassen (Discret. Math., 2021)

On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. - Aleksander B. G. Christiansen; Jacob Holm; Eva Rotenberg; Carsten Thomassen (MFCS, 2022)

Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles. - Carsten Thomassen (J. Comb. Theory B, 2023)

Ádám's conjecture. - Carsten Thomassen (J. Comb. Theory B, 2023)

Group coloring and group connectivity with non-isomorphic groups of the same order. - Rikke Langhede; Carsten Thomassen (Eur. J. Comb., 2024)

Edge-Connectivity Augmentation of Simple Graphs. - Kasper Skov Johansen; Eva Rotenberg; Carsten Thomassen (SIAM J. Discret. Math., 2025)