Carsten Thomassen

ORCID

Publication Activity (10 Years)

Years Active: 1974-2024
Publications (10 Years): 30

Top Venues

J. Comb. Theory, Ser. B

Comb.

Eur. J. Comb.

Electron. J. Comb.

Publications

Rikke Langhede, Carsten Thomassen
Group coloring and group connectivity with non-isomorphic groups of the same order. Eur. J. Comb. 119 (2024)
Carsten Thomassen
Ádám's conjecture. J. Comb. Theory, Ser. B 161 (2023)
Carsten Thomassen
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles. J. Comb. Theory, Ser. B 158 (Part) (2023)
Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS (2022)
Rikke Langhede, Carsten Thomassen
Exponentially many Z5-colorings in simple planar graphs. Discret. Math. 344 (9) (2021)
Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen
Cycles in 5-connected triangulations. J. Comb. Theory, Ser. B 140 (2020)
Carsten Thomassen
Factorizing regular graphs. J. Comb. Theory, Ser. B 141 (2020)
Kathie Cameron, Carsten Thomassen
Cycles containing all the odd-degree vertices. J. Comb. Theory, Ser. B 143 (2020)
James Davies, Carsten Thomassen
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. Electron. J. Comb. 27 (2) (2020)
Rikke Langhede, Carsten Thomassen
Group Connectivity and Group Coloring: Small Groups versus Large Groups. Electron. J. Comb. 27 (1) (2020)
Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt
Planar Ramsey Graphs. Electron. J. Comb. 26 (4) (2019)
Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Carsten Thomassen, Johan P. de Wet
Hamilton cycles in sparse locally connected graphs. Discret. Appl. Math. 257 (2019)
Klas Markström, Carsten Thomassen
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. CoRR (2019)
John Gimbel, André Kündgen, Binlong Li, Carsten Thomassen
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM J. Discret. Math. 33 (3) (2019)
Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt
Planar Ramsey graphs. CoRR (2018)
Jiaao Li, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
The flow index and strongly connected orientations. Eur. J. Comb. 70 (2018)
Carsten Thomassen
Chords in longest cycles. J. Comb. Theory, Ser. B 129 (2018)
Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA (2018)
Carsten Thomassen
The square of a planar cubic graph is 7-colorable. J. Comb. Theory, Ser. B 128 (2018)
Petr Hlinený, Carsten Thomassen
Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. 32 (3) (2018)
Thomas J. Perrett, Carsten Thomassen
Density of Chromatic Roots in Minor-Closed Graph Families. Comb. Probab. Comput. 27 (6) (2018)
André Kündgen, Binlong Li, Carsten Thomassen
Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. 65 (2017)
Carsten Thomassen
Infinitely connected subgraphs in graphs of uncountable chromatic number. Comb. 37 (4) (2017)
Carsten Thomassen
The number of colorings of planar graphs with no separating triangles. J. Comb. Theory, Ser. B 122 (2017)
Seongmin Ok, Carsten Thomassen
-Edge-Connected Graphs. J. Graph Theory 84 (3) (2017)
Julien Bensmail, Martin Merker, Carsten Thomassen
Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Comb. 60 (2017)
Carsten Thomassen
Nash-Williams' cycle-decomposition theorem. Comb. 37 (5) (2017)
Carsten Thomassen
Orientations of infinite graphs with prescribed edge-connectivity. Comb. 36 (5) (2016)
Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J. Comb. Theory, Ser. B 121 (2016)
Seongmin Ok, R. Bruce Richter, Carsten Thomassen
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. Graphs Comb. 32 (6) (2016)
Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, Bernardo Llano, Carsten Thomassen, Rita Zuazua
Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186 (2015)
Carsten Thomassen
Strongly 2-connected orientations of graphs. J. Comb. Theory, Ser. B 110 (2015)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184 (2015)
Adel Alahmadi, Robert E. L. Aldred, Ahmad Alkenani, Rola Hijazi, Patrick Solé, Carsten Thomassen
Extending a perfect matching to a Hamiltonian cycle. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Carsten Thomassen
Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture. J. Comb. Theory, Ser. B 108 (2014)
R. Bruce Richter, Brendan Rooney, Carsten Thomassen
Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". Comb. 34 (2) (2014)
Carsten Thomassen
Graph factors modulo k. J. Comb. Theory, Ser. B 106 (2014)
Carsten Thomassen
Decomposing graphs into paths of fixed length. Comb. 33 (1) (2013)
László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory, Ser. B 103 (5) (2013)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in long codes. Discret. Appl. Math. 161 (3) (2013)
Carsten Thomassen
Decomposing a graph into bistars. J. Comb. Theory, Ser. B 103 (4) (2013)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
][n, k]-code. Discret. Math. 313 (15) (2013)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in an $[n,k]-$code CoRR (2012)
Gek Ling Chia, Carsten Thomassen
On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. 104 (2012)
Ken-ichi Kawarabayashi, Carsten Thomassen
From the plane to higher surfaces. J. Comb. Theory, Ser. B 102 (4) (2012)
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
The maximum number of minimal codewords in long codes CoRR (2012)
Carsten Thomassen
The weak 3-flow conjecture and the weak circular flow conjecture. J. Comb. Theory, Ser. B 102 (2) (2012)
R. Bruce Richter, Brendan Rooney, Carsten Thomassen
On planarity of compact, locally connected, metric spaces. Comb. 31 (3) (2011)
André Kündgen, Gregor Leander, Carsten Thomassen
Switchings, extensions, and reductions in central digraphs. J. Comb. Theory, Ser. A 118 (7) (2011)
Gek Ling Chia, Carsten Thomassen
Grinberg's Criterion Applied to Some Non-Planar Graphs. Ars Comb. 100 (2011)
Meysam Alishahi, Ali Taherkhani, Carsten Thomassen
Rainbow Paths with Prescribed Ends. Electron. J. Comb. 18 (1) (2011)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209 (2) (2011)
Carsten Thomassen
The chromatic polynomial and list colorings. J. Comb. Theory, Ser. B 99 (2) (2009)
Ken-ichi Kawarabayashi, Carsten Thomassen
Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory, Ser. B 99 (4) (2009)
Carsten Thomassen, Antoine Vella
Graph-like continua, augmenting arcs, and Menger's theorem. Comb. 28 (5) (2008)
Robert E. L. Aldred, Carsten Thomassen
On the maximum number of cycles in a planar graph. J. Graph Theory 57 (3) (2008)
Carsten Thomassen
Decompositions of highly connected graphs into paths of length 3. J. Graph Theory 58 (4) (2008)
Carsten Thomassen
2-List-coloring planar graphs without monochromatic triangles. J. Comb. Theory, Ser. B 98 (6) (2008)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA (2007)
Carsten Thomassen
Hajós' conjecture for line graphs. J. Comb. Theory, Ser. B 97 (1) (2007)
Carsten Thomassen
Many 3-colorings of triangle-free planar graphs. J. Comb. Theory, Ser. B 97 (3) (2007)
Carsten Thomassen
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. Comb. 27 (2) (2007)
Carsten Thomassen
Exponentially many 5-list-colorings of planar graphs. J. Comb. Theory, Ser. B 97 (4) (2007)
János Barát, Carsten Thomassen
Claw-decompositions and tutte-orientations. J. Graph Theory 52 (2) (2006)
Reinhard Diestel, Carsten Thomassen
A Cantor-Bernstein Theorem for Paths in Graphs. Am. Math. Mon. 113 (2) (2006)
Vojislav Petrovic, Carsten Thomassen
Edge-disjoint Hamiltonian cycles in hypertournaments. J. Graph Theory 51 (1) (2006)
Carsten Thomassen
Rectangular and visibility representations of infinite planar graphs. J. Graph Theory 52 (3) (2006)
Carsten Thomassen
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. J. Graph Theory 53 (4) (2006)
J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen
Density Conditions For Triangles In Multipartite Graphs. Comb. 26 (2) (2006)
Carsten Thomassen
The number of k-colorings of a graph on a fixed surface. Discret. Math. 306 (23) (2006)
Carsten Thomassen
Some remarks on Hajo's' conjecture. J. Comb. Theory, Ser. B 93 (1) (2005)
Carsten Thomassen
Classification Of Locally 2-Connected Compact Metric Spaces. Comb. 25 (1) (2004)
Robert E. L. Aldred, Carsten Thomassen
Graphs with not all possible path-kernels. Discret. Math. 285 (1-3) (2004)
Carsten Thomassen
The Locally Connected Compact Metric Spaces Embeddable In The Plane. Comb. 24 (4) (2004)
Carsten Thomassen
Tutte's spring theorem. J. Graph Theory 45 (4) (2004)
Carsten Thomassen
The chromatic number of a graph of girth 5 on a fixed surface. J. Comb. Theory, Ser. B 87 (1) (2003)
Carsten Thomassen
A short list color proof of Grötzsch's theorem. J. Comb. Theory, Ser. B 88 (1) (2003)
Carsten Thomassen
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. Comb. 22 (4) (2002)
Carsten Thomassen
An intersection graph of straight lines. Discret. Math. 259 (1-3) (2002)
Thomas Böhme, Bojan Mohar, Carsten Thomassen
Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 85 (2) (2002)
Carsten Thomassen
-subdivisions in 4-chromatic Graphs. Comb. 21 (3) (2001)
Carsten Thomassen
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. J. Comb. Theory, Ser. B 83 (2) (2001)
Carsten Thomassen
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. Comb. 21 (2) (2001)
Tommy R. Jensen, Carsten Thomassen
The color space of a graph. J. Graph Theory 34 (3) (2000)
John Gimbel, Carsten Thomassen
Coloring triangle-free graphs with fixed size. Discret. Math. 219 (1-3) (2000)
Carsten Thomassen
Chromatic Roots and Hamiltonian Paths. J. Comb. Theory, Ser. B 80 (2) (2000)
Carsten Thomassen
The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space. Am. Math. Mon. 107 (2) (2000)
Carsten Thomassen
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. J. Comb. Theory, Ser. B 75 (1) (1999)
Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
Highly Connected Sets and the Excluded Grid Theorem. J. Comb. Theory, Ser. B 75 (1) (1999)
Carsten Thomassen
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. J. Comb. Theory, Ser. B 72 (1) (1998)
Robert E. L. Aldred, Carsten Thomassen
On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory, Ser. B 71 (1) (1997)
Carsten Thomassen
Color-Critical Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 70 (1) (1997)
Carsten Thomassen
On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM J. Comput. 26 (3) (1997)
Carsten Thomassen
The Zero-Free Intervals for Chromatic Polynomials of Graphs. Comb. Probab. Comput. 6 (4) (1997)
Carsten Thomassen
The Genus Problem for Cubic Graphs. J. Comb. Theory, Ser. B 69 (1) (1997)
Carsten Thomassen
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. J. Comb. Theory, Ser. B 70 (2) (1997)
Carsten Thomassen
Chords of Longest Cycles in Cubic Graphs. J. Comb. Theory, Ser. B 71 (2) (1997)
Carsten Thomassen
-subdivisions. Discret. Math. (1997)
Carsten Thomassen
On the Number of Hamiltonian Cycles in Bipartite Graphs. Comb. Probab. Comput. 5 (1996)
Carsten Thomassen
K5-Subdivisions in Graphs. Comb. Probab. Comput. 5 (1996)

Carsten Thomassen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Carsten Thomassen