Carsten Thomassen

Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen: The maximum number of minimal codewords in long codes. Discrete Applied Mathematics 161(3): 424-429 (2013)

Adel Alahmadi, Robert E. L. Aldred, R. de la Cruz, Patrick Solé, Carsten Thomassen: The maximum number of minimal codewords in an [n, k][n, k]-code. Discrete Mathematics 313(15): 1569-1574 (2013)

Gek L. Chia, Carsten Thomassen: On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. 104: 307-320 (2012)

Carsten Thomassen: The weak 3-flow conjecture and the weak circular flow conjecture. J. Comb. Theory, Ser. B 102(2): 521-529 (2012)

Ken-ichi Kawarabayashi, Carsten Thomassen: From the plane to higher surfaces. J. Comb. Theory, Ser. B 102(4): 852-868 (2012)

Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen: The maximum number of minimal codewords in long codes. CoRR abs/1201.6043 (2012)

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 abs/1203.0728 (2012)

Gek L. Chia, Carsten Thomassen: Grinberg's Criterion Applied to Some Non-Planar Graphs. Ars Comb. 100: 3-7 (2011)

R. Bruce Richter, Brendan Rooney, Carsten Thomassen: On planarity of compact, locally connected, metric spaces. Combinatorica 31(3): 365-376 (2011)

Meysam Alishahi, Ali Taherkhani, Carsten Thomassen: Rainbow Paths with Prescribed Ends. Electr. 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): 143-153 (2011)

André Kündgen, Gregor Leander, Carsten Thomassen: Switchings, extensions, and reductions in central digraphs. J. Comb. Theory, Ser. A 118(7): 2025-2034 (2011)

Carsten Thomassen: The chromatic polynomial and list colorings. J. Comb. Theory, Ser. B 99(2): 474-479 (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): 674-684 (2009)

Carsten Thomassen, Antoine Vella: Graph-like continua, augmenting arcs, and Menger's theorem. Combinatorica 28(5): 595-623 (2008)

Carsten Thomassen: 2-List-coloring planar graphs without monochromatic triangles. J. Comb. Theory, Ser. B 98(6): 1337-1348 (2008)

Robert E. L. Aldred, Carsten Thomassen: On the maximum number of cycles in a planar graph. Journal of Graph Theory 57(3): 255-264 (2008)

Carsten Thomassen: Decompositions of highly connected graphs into paths of length 3. Journal of Graph Theory 58(4): 286-292 (2008)

Carsten Thomassen: On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. Combinatorica 27(2): 241-243 (2007)

Carsten Thomassen: Hajós' conjecture for line graphs. J. Comb. Theory, Ser. B 97(1): 156-157 (2007)

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

Carsten Thomassen: Exponentially many 5-list-colorings of planar graphs. J. Comb. Theory, Ser. B 97(4): 571-583 (2007)

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: 366-377

John Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen: Density Conditions For Triangles In Multipartite Graphs. Combinatorica 26(2): 121-131 (2006)

Carsten Thomassen: The number of k-colorings of a graph on a fixed surface. Discrete Mathematics 306(23): 3145-3153 (2006)

Vojislav Petrovic, Carsten Thomassen: Edge-disjoint Hamiltonian cycles in hypertournaments. Journal of Graph Theory 51(1): 49-52 (2006)

János Barát, Carsten Thomassen: Claw-decompositions and tutte-orientations. Journal of Graph Theory 52(2): 135-146 (2006)

Carsten Thomassen: Rectangular and visibility representations of infinite planar graphs. Journal of Graph Theory 52(3): 257-265 (2006)

Carsten Thomassen: On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. Journal of Graph Theory 53(4): 261-269 (2006)

Reinhard Diestel, Carsten Thomassen: A Cantor-Bernstein Theorem for Paths in Graphs. The American Mathematical Monthly 113(2): 161-165 (2006)

Carsten Thomassen: Some remarks on Hajo's' conjecture. J. Comb. Theory, Ser. B 93(1): 95-105 (2005)

Carsten Thomassen: The Locally Connected Compact Metric Spaces Embeddable In The Plane. Combinatorica 24(4): 699-718 (2004)

Carsten Thomassen: Classification Of Locally 2-Connected Compact Metric Spaces. Combinatorica 25(1): 85-103 (2004)

Robert E. L. Aldred, Carsten Thomassen: Graphs with not all possible path-kernels. Discrete Mathematics 285(1-3): 297-300 (2004)

Carsten Thomassen: Tutte's spring theorem. Journal of Graph Theory 45(4): 275-280 (2004)

Carsten Thomassen: The chromatic number of a graph of girth 5 on a fixed surface. J. Comb. Theory, Ser. B 87(1): 38-71 (2003)

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

Carsten Thomassen: On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. Combinatorica 22(4): 591-596 (2002)

Carsten Thomassen: An intersection graph of straight lines. Discrete Mathematics 259(1-3): 359-360 (2002)

Thomas Böhme, Bojan Mohar, Carsten Thomassen: Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 85(2): 338-347 (2002)

Bojan Mohar, Carsten Thomassen: Graphs on Surfaces. Johns Hopkins series in the mathematical sciences, Johns Hopkins University Press 2001, isbn 978-0-8018-6689-0, pp. I-XI, 1-291

Carsten Thomassen: The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. Combinatorica 21(2): 321-333 (2001)

Carsten Thomassen: Totally Odd K₄-subdivisions in 4-chromatic Graphs. Combinatorica 21(3): 417-443 (2001)

Carsten Thomassen: Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. J. Comb. Theory, Ser. B 83(2): 262-271 (2001)

John Gimbel, Carsten Thomassen: Coloring triangle-free graphs with fixed size. Discrete Mathematics 219(1-3): 275-277 (2000)

Carsten Thomassen: Chromatic Roots and Hamiltonian Paths. J. Comb. Theory, Ser. B 80(2): 218-224 (2000)

Tommy R. Jensen, Carsten Thomassen: The color space of a graph. Journal of Graph Theory 34(3): 234-245 (2000)

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): 61-73 (1999)

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): 100-109 (1999)

Carsten Thomassen: Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. J. Comb. Theory, Ser. B 72(1): 104-109 (1998)

Carsten Thomassen: The Zero-Free Intervals for Chromatic Polynomials of Graphs. Combinatorics, Probability & Computing 6(4): 497-506 (1997)

Carsten Thomassen: Dirac's conjecture on K₅-subdivisions. Discrete Mathematics 165-166: 607-608 (1997)

Carsten Thomassen: The Genus Problem for Cubic Graphs. J. Comb. Theory, Ser. B 69(1): 52-58 (1997)

Carsten Thomassen: Color-Critical Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 70(1): 67-100 (1997)

Carsten Thomassen: A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. J. Comb. Theory, Ser. B 70(2): 306-311 (1997)

Robert E. L. Aldred, Carsten Thomassen: On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory, Ser. B 71(1): 79-84 (1997)

Carsten Thomassen: Chords of Longest Cycles in Cubic Graphs. J. Comb. Theory, Ser. B 71(2): 211-214 (1997)

Carsten Thomassen: On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM J. Comput. 26(3): 675-677 (1997)

Carsten Thomassen: K5-Subdivisions in Graphs. Combinatorics, Probability & Computing 5: 179-189 (1996)

Carsten Thomassen: On the Number of Hamiltonian Cycles in Bipartite Graphs. Combinatorics, Probability & Computing 5: 437-442 (1996)

Carsten Thomassen: Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. J. Comb. Theory, Ser. B 66(1): 24-33 (1996)

R. Bruce Richter, Carsten Thomassen: Intersections of Curve Systems and the Crossing Number of C₅ X C₅. Discrete & Computational Geometry 13: 149-159 (1995)

Carsten Thomassen: 3-List-Coloring Planar Graphs of Girth 5. J. Comb. Theory, Ser. B 64(1): 101-107 (1995)

Carsten Thomassen: Decomposing a Planar Graph into Degenerate Graphs. J. Comb. Theory, Ser. B 65(2): 305-314 (1995)

Carsten Thomassen: Embeddings of graphs. Discrete Mathematics 124(1-3): 217-228 (1994)

Carsten Thomassen: Trees in Triangulations. J. Comb. Theory, Ser. B 60(1): 56-62 (1994)

Carsten Thomassen: Five-Coloring Graphs on the Torus. J. Comb. Theory, Ser. B 62(1): 11-33 (1994)

Carsten Thomassen: Every Planar Graph Is 5-Choosable. J. Comb. Theory, Ser. B 62(1): 180-181 (1994)

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

Carsten Thomassen, Edward R. Scheinerman: Editorial. Journal of Graph Theory 18(4): 323 (1994)

Carsten Thomassen: The Even Cycle Problem for Planar Digraphs. J. Algorithms 15(1): 61-75 (1993)

Carsten Thomassen: Triangulating a Surface with a Prescribed Graph. J. Comb. Theory, Ser. B 57(2): 196-206 (1993)

R. Bruce Richter, Carsten Thomassen: Minimal Graphs with Crossing Number at Least k. J. Comb. Theory, Ser. B 58(2): 217-224 (1993)

Carsten Thomassen, Wolfgang Woess: Vertex-Transitive Graphs and Accessibility. J. Comb. Theory, Ser. B 58(2): 248-268 (1993)

Carsten Thomassen: Five-Coloring Maps on Surfaces. J. Comb. Theory, Ser. B 59(1): 89-105 (1993)

Carsten Thomassen: The Hadwiger number of subgroups vertex-transitive graphs. Combinatorica 12(4): 481-492 (1992)

Carsten Thomassen: Plane Cubic Graphs with Prescribed Face Areas. Combinatorics, Probability & Computing 1: 371-381 (1992)

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

Carsten Thomassen: Infinite connected graphs with no end-preserving spanning trees. J. Comb. Theory, Ser. B 54(2): 322-324 (1992)

Jørgen Bang-Jensen, Carsten Thomassen: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. SIAM J. Discrete Math. 5(3): 366-376 (1992)

Carsten Thomassen: Highly connected non-2-linked digraphs. Combinatorica 11(4): 393-395 (1991)

Vojislav Petrovic, Carsten Thomassen: Kings in k-partite tournaments. Discrete Mathematics 98(3): 237-238 (1991)

Carsten Thomassen: Embeddings of graphs with no short noncontractible cycles. J. Comb. Theory, Ser. B 48(2): 155-177 (1990)

Carsten Thomassen: Resistances and currents in infinite electrical networks. J. Comb. Theory, Ser. B 49(1): 87-102 (1990)

Carsten Thomassen: Bidirectional retracting-free double tracings and upper embeddability of graphs. J. Comb. Theory, Ser. B 50(2): 198-207 (1990)

Michael O. Albertson, David M. Berman, Joan P. Hutchinson, Carsten Thomassen: Graphs with homeomorphically irreducible spanning trees. Journal of Graph Theory 14(2): 247-258 (1990)

Carsten Thomassen: The Graph Genus Problem is NP-Complete. J. Algorithms 10(4): 568-576 (1989)

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

Ron Aharoni, Carsten Thomassen: Infinite, highly connected digraphs with no two arc-disjoint spanning trees. Journal of Graph Theory 13(1): 71-74 (1989)

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

Carsten Thomassen: Arc reversals in tournaments. Discrete Mathematics 71(1): 73-86 (1988)

Carsten Thomassen: On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory 12(1): 101-111 (1988)

Carsten Thomassen: Rectilinear drawings of graphs. Journal of Graph Theory 12(3): 335-341 (1988)

Carsten Thomassen: On digraphs with no two disjoint directed cycles. Combinatorica 7(1): 145-150 (1987)

Pierre Fraisse, Carsten Thomassen: Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs and Combinatorics 3(1): 239-250 (1987)

Paul D. Seymour, Carsten Thomassen: Characterization of even directed graphs. J. Comb. Theory, Ser. B 42(1): 36-45 (1987)

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

Carsten Thomassen: A characterization of locally finite vertex-transitive graphs. J. Comb. Theory, Ser. B 43(1): 116-119 (1987)

Gena Hahn, Carsten Thomassen: Path and cycle sub-ramsey numbers and an edge-colouring conjecture. Discrete Mathematics 62(1): 29-33 (1986)

Carsten Thomassen: Interval representations of planar graphs. J. Comb. Theory, Ser. B 40(1): 9-20 (1986)

Carsten Thomassen: The 2-linkage problem for acyclic digraphs. Discrete Mathematics 55(1): 73-87 (1985)

Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen: Cycles through four edges in 3-connected cubic graphs. Graphs and Combinatorics 1(1): 7-11 (1985)

Carsten Thomassen: Subgraphs with large degrees and girth. Graphs and Combinatorics 1(1): 299-300 (1985)

Carsten Thomassen: A refinement of Kuratowski's theorem. J. Comb. Theory, Ser. B 37(3): 245-253 (1984)

Carsten Thomassen: Cycles in graphs of uncountable chromatic number. Combinatorica 3(1): 133-134 (1983)

Carsten Thomassen: Disjoint cycles in digraphs. Combinatorica 3(3): 393-396 (1983)

Carsten Thomassen: Deformations of plane graphs. J. Comb. Theory, Ser. B 34(3): 244-257 (1983)

Carsten Thomassen: Girth in graphs. J. Comb. Theory, Ser. B 35(2): 129-141 (1983)

Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen: A nine point theorem for 3-connected graphs. Combinatorica 2(1): 53-62 (1982)

Roland Häggkvist, Carsten Thomassen: Circuits through specified edges. Discrete Mathematics 41(1): 29-34 (1982)

Carsten Thomassen: Planar cubic hypohamiltonian and hypotraceable graphs. J. Comb. Theory, Ser. B 30(1): 36-44 (1981)

Carsten Thomassen: On the number of Hamiltonian cycles in tournaments. Discrete Mathematics 31(3): 315-323 (1980)

Carsten Thomassen: Hamiltonian-connected tournaments. J. Comb. Theory, Ser. B 28(2): 142-163 (1980)

Carsten Thomassen: Planarity and duality of finite and infinite graphs. J. Comb. Theory, Ser. B 29(2): 244-271 (1980)

Vasek Chvátal, Carsten Thomassen: Distances in orientations of graphs. J. Comb. Theory, Ser. B 24(1): 61-75 (1978)

Carsten Thomassen: Note on circuits containing specified edges. J. Comb. Theory, Ser. B 22(3): 279-280 (1977)