Carsten Thomassen
Orcid: 0000-0003-0670-4079Affiliations:
- Technical University of Denmark
According to our database1,
Carsten Thomassen
authored at least 181 papers
between 1974 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2024
Eur. J. Comb., 2024
2023
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles.
J. Comb. Theory B, 2023
2022
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
2020
Electron. J. Comb., 2020
Electron. J. Comb., 2020
2019
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.
SIAM J. Discret. Math., 2019
CoRR, 2019
2018
Comb. Probab. Comput., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
J. Graph Theory, 2017
J. Comb. Theory B, 2017
Eur. J. Comb., 2017
Comb., 2017
2016
J. Comb. Theory B, 2016
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity.
Graphs Comb., 2016
2015
Discret. Math. Theor. Comput. Sci., 2015
Discret. Appl. Math., 2015
2014
J. Comb. Theory B, 2014
Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces".
Comb., 2014
2013
Discret. Math., 2013
2012
J. Comb. Theory B, 2012
On the Number of Longest and Almost Longest Cycles in Cubic Graphs.
Ars Comb., 2012
2011
Inf. Comput., 2011
Grinberg's Criterion Applied to Some Non-Planar Graphs.
Ars Comb., 2011
2009
J. Comb. Theory B, 2009
2008
J. Graph Theory, 2008
J. Comb. Theory B, 2008
2007
2006
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation.
J. Graph Theory, 2006
J. Graph Theory, 2006
2005
2004
2003
J. Comb. Theory B, 2003
2002
2001
J. Comb. Theory B, 2001
Johns Hopkins series in the mathematical sciences, Johns Hopkins University Press, ISBN: 978-0-8018-6689-0, 2001
2000
Am. Math. Mon., 2000
1999
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
J. Comb. Theory B, 1999
1998
J. Comb. Theory B, 1998
1997
J. Comb. Theory B, 1997
Comb. Probab. Comput., 1997
1996
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs.
J. Comb. Theory B, 1996
1995
Intersections of Curve Systems and the Crossing Number of C<sub>5</sub> X C<sub>5</sub>.
Discret. Comput. Geom., 1995
1994
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane.
J. Comb. Theory B, 1994
1993
1992
SIAM J. Discret. Math., 1992
J. Comb. Theory B, 1992
J. Algorithms, 1992
1991
1990
J. Comb. Theory B, 1990
1989
J. Graph Theory, 1989
J. Comb. Theory B, 1989
1988
1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
J. Graph Theory, 1987
J. Comb. Theory B, 1987
J. Comb. Theory B, 1987
1986
Discret. Math., 1986
1985
1984
1983
Graph decomposition with applications to subdivisions and path systems modulo <i>k</i>.
J. Graph Theory, 1983
J. Graph Theory, 1983
1982
1981
J. Comb. Theory B, 1981
1980
1979
1978
J. Graph Theory, 1978
Discret. Math., 1978
1977
Discret. Math., 1977
1976
1974