default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarsten Thomassen
Person information
- affiliation: Technical University of Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j176]Rikke Langhede, Carsten Thomassen:
Group coloring and group connectivity with non-isomorphic groups of the same order. Eur. J. Comb. 119: 103816 (2024)- 2023
- [j175]Carsten Thomassen
:
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles. J. Comb. Theory B 158(Part): 301-312 (2023) - [j174]Carsten Thomassen:
Ádám's conjecture. J. Comb. Theory B 161: 15-20 (2023) - 2022
- [c3]Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen:
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS 2022: 34:1-34:15 - 2021
- [j173]Rikke Langhede, Carsten Thomassen:
Exponentially many Z5-colorings in simple planar graphs. Discret. Math. 344(9): 112474 (2021) - 2020
- [j172]Rikke Langhede, Carsten Thomassen:
Group Connectivity and Group Coloring: Small Groups versus Large Groups. Electron. J. Comb. 27(1): 1 (2020) - [j171]James Davies, Carsten Thomassen:
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. Electron. J. Comb. 27(2): 2 (2020) - [j170]Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen:
Cycles in 5-connected triangulations. J. Comb. Theory, Ser. B 140: 27-44 (2020) - [j169]Carsten Thomassen:
Factorizing regular graphs. J. Comb. Theory B 141: 343-351 (2020) - [j168]Kathie Cameron, Carsten Thomassen:
Cycles containing all the odd-degree vertices. J. Comb. Theory B 143: 219-225 (2020)
2010 – 2019
- 2019
- [j167]Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt:
Planar Ramsey Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j166]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: 276-288 (2019) - [j165]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): 1415-1430 (2019) - [i4]Klas Markström, Carsten Thomassen:
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. CoRR abs/1903.04270 (2019) - 2018
- [j164]Thomas J. Perrett, Carsten Thomassen:
Density of Chromatic Roots in Minor-Closed Graph Families. Comb. Probab. Comput. 27(6): 988-998 (2018) - [j163]Jiaao Li, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
The flow index and strongly connected orientations. Eur. J. Comb. 70: 164-177 (2018) - [j162]Carsten Thomassen:
The square of a planar cubic graph is 7-colorable. J. Comb. Theory B 128: 192-218 (2018) - [j161]Carsten Thomassen:
Chords in longest cycles. J. Comb. Theory B 129: 148-157 (2018) - [j160]Petr Hlinený, Carsten Thomassen:
Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. 32(3): 1962-1965 (2018) - [c2]Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA 2018: 1645-1649 - [i3]Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt:
Planar Ramsey graphs. CoRR abs/1812.00832 (2018) - 2017
- [j159]Carsten Thomassen:
Infinitely connected subgraphs in graphs of uncountable chromatic number. Comb. 37(4): 785-793 (2017) - [j158]Carsten Thomassen:
Nash-Williams' cycle-decomposition theorem. Comb. 37(5): 1027-1037 (2017) - [j157]Julien Bensmail, Martin Merker, Carsten Thomassen:
Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Comb. 60: 124-134 (2017) - [j156]André Kündgen, Binlong Li, Carsten Thomassen:
Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. 65: 259-275 (2017) - [j155]Carsten Thomassen:
The number of colorings of planar graphs with no separating triangles. J. Comb. Theory B 122: 615-633 (2017) - [j154]Seongmin Ok, Carsten Thomassen:
On the Minimum Number of Spanning Trees in k-Edge-Connected Graphs. J. Graph Theory 84(3): 286-296 (2017) - 2016
- [j153]Carsten Thomassen:
Orientations of infinite graphs with prescribed edge-connectivity. Comb. 36(5): 601-621 (2016) - [j152]Seongmin Ok, R. Bruce Richter, Carsten Thomassen:
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. Graphs Comb. 32(6): 2575-2589 (2016) - [j151]Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J. Comb. Theory B 121: 308-325 (2016) - 2015
- [j150]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: 32-39 (2015) - [j149]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: 251-259 (2015) - [j148]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): 241-254 (2015) - [j147]Carsten Thomassen:
Strongly 2-connected orientations of graphs. J. Comb. Theory B 110: 67-78 (2015) - 2014
- [j146]R. Bruce Richter, Brendan Rooney, Carsten Thomassen:
Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". Comb. 34(2): 253-254 (2014) - [j145]Carsten Thomassen:
Graph factors modulo k. J. Comb. Theory B 106: 174-177 (2014) - [j144]Carsten Thomassen:
Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture. J. Comb. Theory B 108: 81-91 (2014) - 2013
- [j143]Carsten Thomassen:
Decomposing graphs into paths of fixed length. Comb. 33(1): 97-123 (2013) - [j142]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): 424-429 (2013) - [j141]Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an [n, k][n, k]-code. Discret. Math. 313(15): 1569-1574 (2013) - [j140]Carsten Thomassen:
Decomposing a graph into bistars. J. Comb. Theory B 103(4): 504-508 (2013) - [j139]László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang:
Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory B 103(5): 587-598 (2013) - 2012
- [j138]Gek Ling Chia, Carsten Thomassen:
On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. 104: 307-320 (2012) - [j137]Carsten Thomassen:
The weak 3-flow conjecture and the weak circular flow conjecture. J. Comb. Theory B 102(2): 521-529 (2012) - [j136]Ken-ichi Kawarabayashi, Carsten Thomassen:
From the plane to higher surfaces. J. Comb. Theory B 102(4): 852-868 (2012) - [i2]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) - [i1]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) - 2011
- [j135]Gek Ling Chia, Carsten Thomassen:
Grinberg's Criterion Applied to Some Non-Planar Graphs. Ars Comb. 100: 3-7 (2011) - [j134]R. Bruce Richter, Brendan Rooney, Carsten Thomassen:
On planarity of compact, locally connected, metric spaces. Comb. 31(3): 365-376 (2011) - [j133]Meysam Alishahi, Ali Taherkhani, Carsten Thomassen:
Rainbow Paths with Prescribed Ends. Electron. J. Comb. 18(1) (2011) - [j132]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) - [j131]André Kündgen, Gregor Leander, Carsten Thomassen:
Switchings, extensions, and reductions in central digraphs. J. Comb. Theory A 118(7): 2025-2034 (2011)
2000 – 2009
- 2009
- [j130]Carsten Thomassen:
The chromatic polynomial and list colorings. J. Comb. Theory B 99(2): 474-479 (2009) - [j129]Ken-ichi Kawarabayashi, Carsten Thomassen:
Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory B 99(4): 674-684 (2009) - 2008
- [j128]Carsten Thomassen, Antoine Vella:
Graph-like continua, augmenting arcs, and Menger's theorem. Comb. 28(5): 595-623 (2008) - [j127]Carsten Thomassen:
2-List-coloring planar graphs without monochromatic triangles. J. Comb. Theory B 98(6): 1337-1348 (2008) - [j126]Robert E. L. Aldred, Carsten Thomassen:
On the maximum number of cycles in a planar graph. J. Graph Theory 57(3): 255-264 (2008) - [j125]Carsten Thomassen:
Decompositions of highly connected graphs into paths of length 3. J. Graph Theory 58(4): 286-292 (2008) - 2007
- [j124]Carsten Thomassen:
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. Comb. 27(2): 241-243 (2007) - [j123]Carsten Thomassen:
Hajós' conjecture for line graphs. J. Comb. Theory B 97(1): 156-157 (2007) - [j122]Carsten Thomassen:
Many 3-colorings of triangle-free planar graphs. J. Comb. Theory B 97(3): 334-349 (2007) - [j121]Carsten Thomassen:
Exponentially many 5-list-colorings of planar graphs. J. Comb. Theory B 97(4): 571-583 (2007) - [c1]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 - 2006
- [j120]J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen:
Density Conditions For Triangles In Multipartite Graphs. Comb. 26(2): 121-131 (2006) - [j119]Carsten Thomassen:
The number of k-colorings of a graph on a fixed surface. Discret. Math. 306(23): 3145-3153 (2006) - [j118]Vojislav Petrovic, Carsten Thomassen:
Edge-disjoint Hamiltonian cycles in hypertournaments. J. Graph Theory 51(1): 49-52 (2006) - [j117]János Barát, Carsten Thomassen:
Claw-decompositions and tutte-orientations. J. Graph Theory 52(2): 135-146 (2006) - [j116]Carsten Thomassen:
Rectangular and visibility representations of infinite planar graphs. J. Graph Theory 52(3): 257-265 (2006) - [j115]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): 261-269 (2006) - [j114]Reinhard Diestel, Carsten Thomassen:
A Cantor-Bernstein Theorem for Paths in Graphs. Am. Math. Mon. 113(2): 161-165 (2006) - 2005
- [j113]Carsten Thomassen:
Some remarks on Hajo's' conjecture. J. Comb. Theory B 93(1): 95-105 (2005) - 2004
- [j112]Carsten Thomassen:
The Locally Connected Compact Metric Spaces Embeddable In The Plane. Comb. 24(4): 699-718 (2004) - [j111]Carsten Thomassen:
Classification Of Locally 2-Connected Compact Metric Spaces. Comb. 25(1): 85-103 (2004) - [j110]Robert E. L. Aldred, Carsten Thomassen:
Graphs with not all possible path-kernels. Discret. Math. 285(1-3): 297-300 (2004) - [j109]Carsten Thomassen:
Tutte's spring theorem. J. Graph Theory 45(4): 275-280 (2004) - 2003
- [j108]Carsten Thomassen:
The chromatic number of a graph of girth 5 on a fixed surface. J. Comb. Theory B 87(1): 38-71 (2003) - [j107]Carsten Thomassen:
A short list color proof of Grötzsch's theorem. J. Comb. Theory B 88(1): 189-192 (2003) - 2002
- [j106]Carsten Thomassen:
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. Comb. 22(4): 591-596 (2002) - [j105]Carsten Thomassen:
An intersection graph of straight lines. Discret. Math. 259(1-3): 359-360 (2002) - [j104]Thomas Böhme, Bojan Mohar, Carsten Thomassen:
Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory B 85(2): 338-347 (2002) - 2001
- [b1]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 - [j103]Carsten Thomassen:
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. Comb. 21(2): 321-333 (2001) - [j102]Carsten Thomassen:
Totally Odd K4-subdivisions in 4-chromatic Graphs. Comb. 21(3): 417-443 (2001) - [j101]Carsten Thomassen:
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. J. Comb. Theory B 83(2): 262-271 (2001) - 2000
- [j100]John Gimbel, Carsten Thomassen:
Coloring triangle-free graphs with fixed size. Discret. Math. 219(1-3): 275-277 (2000) - [j99]Carsten Thomassen:
Chromatic Roots and Hamiltonian Paths. J. Comb. Theory B 80(2): 218-224 (2000) - [j98]Tommy R. Jensen, Carsten Thomassen:
The color space of a graph. J. Graph Theory 34(3): 234-245 (2000) - [j97]Carsten Thomassen:
The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space. Am. Math. Mon. 107(2): 163-166 (2000)
1990 – 1999
- 1999
- [j96]Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen:
Highly Connected Sets and the Excluded Grid Theorem. J. Comb. Theory B 75(1): 61-73 (1999) - [j95]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 B 75(1): 100-109 (1999) - 1998
- [j94]Carsten Thomassen:
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. J. Comb. Theory B 72(1): 104-109 (1998) - 1997
- [j93]Carsten Thomassen:
The Zero-Free Intervals for Chromatic Polynomials of Graphs. Comb. Probab. Comput. 6(4): 497-506 (1997) - [j92]Carsten Thomassen:
Dirac's conjecture on K5-subdivisions. Discret. Math. 165-166: 607-608 (1997) - [j91]Carsten Thomassen:
The Genus Problem for Cubic Graphs. J. Comb. Theory B 69(1): 52-58 (1997) - [j90]Carsten Thomassen:
Color-Critical Graphs on a Fixed Surface. J. Comb. Theory B 70(1): 67-100 (1997) - [j89]Carsten Thomassen:
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. J. Comb. Theory B 70(2): 306-311 (1997) - [j88]Robert E. L. Aldred, Carsten Thomassen:
On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory B 71(1): 79-84 (1997) - [j87]Carsten Thomassen:
Chords of Longest Cycles in Cubic Graphs. J. Comb. Theory B 71(2): 211-214 (1997) - [j86]Carsten Thomassen:
On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM J. Comput. 26(3): 675-677 (1997) - 1996
- [j85]Carsten Thomassen:
K5-Subdivisions in Graphs. Comb. Probab. Comput. 5: 179-189 (1996) - [j84]Carsten Thomassen:
On the Number of Hamiltonian Cycles in Bipartite Graphs. Comb. Probab. Comput. 5: 437-442 (1996) - [j83]Carsten Thomassen:
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. J. Comb. Theory B 66(1): 24-33 (1996) - 1995
- [j82]R. Bruce Richter, Carsten Thomassen:
Intersections of Curve Systems and the Crossing Number of C5 X C5. Discret. Comput. Geom. 13: 149-159 (1995) - [j81]Carsten Thomassen:
3-List-Coloring Planar Graphs of Girth 5. J. Comb. Theory B 64(1): 101-107 (1995) - [j80]Carsten Thomassen:
Decomposing a Planar Graph into Degenerate Graphs. J. Comb. Theory B 65(2): 305-314 (1995) - 1994
- [j79]Carsten Thomassen:
Embeddings of graphs. Discret. Math. 124(1-3): 217-228 (1994) - [j78]Carsten Thomassen:
Trees in Triangulations. J. Comb. Theory B 60(1): 56-62 (1994) - [j77]Carsten Thomassen:
Five-Coloring Graphs on the Torus. J. Comb. Theory B 62(1): 11-33 (1994) - [j76]Carsten Thomassen:
Every Planar Graph Is 5-Choosable. J. Comb. Theory B 62(1): 180-181 (1994) - [j75]Carsten Thomassen:
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane. J. Comb. Theory B 62(2): 268-279 (1994) - [j74]Carsten Thomassen, Edward R. Scheinerman:
Editorial. J. Graph Theory 18(4): 323 (1994) - 1993
- [j73]Carsten Thomassen:
The Even Cycle Problem for Planar Digraphs. J. Algorithms 15(1): 61-75 (1993) - [j72]Carsten Thomassen:
Triangulating a Surface with a Prescribed Graph. J. Comb. Theory B 57(2): 196-206 (1993) - [j71]R. Bruce Richter, Carsten Thomassen:
Minimal Graphs with Crossing Number at Least k. J. Comb. Theory B 58(2): 217-224 (1993) - [j70]Carsten Thomassen, Wolfgang Woess:
Vertex-Transitive Graphs and Accessibility. J. Comb. Theory B 58(2): 248-268 (1993) - [j69]Carsten Thomassen:
Five-Coloring Maps on Surfaces. J. Comb. Theory B 59(1): 89-105 (1993) - 1992
- [j68]Carsten Thomassen:
The Hadwiger number of subgroups vertex-transitive graphs. Comb. 12(4): 481-492 (1992) - [j67]Carsten Thomassen:
Plane Cubic Graphs with Prescribed Face Areas. Comb. Probab. Comput. 1: 371-381 (1992) - [j66]Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992) - [j65]Carsten Thomassen:
Infinite connected graphs with no end-preserving spanning trees. J. Comb. Theory B 54(2): 322-324 (1992) - [j64]Jørgen Bang-Jensen, Carsten Thomassen:
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. SIAM J. Discret. Math. 5(3): 366-376 (1992) - 1991
- [j63]Carsten Thomassen:
Highly connected non-2-linked digraphs. Comb. 11(4): 393-395 (1991) - [j62]Vojislav Petrovic, Carsten Thomassen:
Kings in k-partite tournaments. Discret. Math. 98(3): 237-238 (1991) - 1990
- [j61]Carsten Thomassen:
Embeddings of graphs with no short noncontractible cycles. J. Comb. Theory B 48(2): 155-177 (1990) - [j60]Carsten Thomassen:
Resistances and currents in infinite electrical networks. J. Comb. Theory B 49(1): 87-102 (1990) - [j59]Carsten Thomassen:
Bidirectional retracting-free double tracings and upper embeddability of graphs. J. Comb. Theory B 50(2): 198-207 (1990) - [j58]Michael O. Albertson, David M. Berman, Joan P. Hutchinson, Carsten Thomassen:
Graphs with homeomorphically irreducible spanning trees. J. Graph Theory 14(2): 247-258 (1990)
1980 – 1989
- 1989
- [j57]Carsten Thomassen:
The Graph Genus Problem is NP-Complete. J. Algorithms 10(4): 568-576 (1989) - [j56]Carsten Thomassen:
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. J. Comb. Theory B 46(3): 257-291 (1989) - [j55]Ron Aharoni, Carsten Thomassen:
Infinite, highly connected digraphs with no two arc-disjoint spanning trees. J. Graph Theory 13(1): 71-74 (1989) - [j54]Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk:
Tight bounds on the chromatic sum of a connected graph. J. Graph Theory 13(3): 353-357 (1989) - 1988
- [j53]Carsten Thomassen:
Arc reversals in tournaments. Discret. Math. 71(1): 73-86 (1988) - [j52]Carsten Thomassen:
On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12(1): 101-111 (1988) - [j51]Carsten Thomassen:
Rectilinear drawings of graphs. J. Graph Theory 12(3): 335-341 (1988) - 1987
- [j50]Carsten Thomassen:
On digraphs with no two disjoint directed cycles. Comb. 7(1): 145-150 (1987) - [j49]Pierre Fraisse, Carsten Thomassen:
Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs Comb. 3(1): 239-250 (1987) - [j48]Paul D. Seymour, Carsten Thomassen:
Characterization of even directed graphs. J. Comb. Theory B 42(1): 36-45 (1987) - [j47]Carsten Thomassen:
Counterexamples to Adám's conjecture on arc reversals in directed graphs. J. Comb. Theory B 42(1): 128-130 (1987) - [j46]Carsten Thomassen:
A characterization of locally finite vertex-transitive graphs. J. Comb. Theory B 43(1): 116-119 (1987) - [j45]Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour:
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory 11(3): 367-371 (1987) - 1986
- [j44]Gena Hahn, Carsten Thomassen:
Path and cycle sub-ramsey numbers and an edge-colouring conjecture. Discret. Math. 62(1): 29-33 (1986) - [j43]Carsten Thomassen:
Interval representations of planar graphs. J. Comb. Theory B 40(1): 9-20 (1986) - [j42]Carsten Thomassen:
Reflections on graph theory. J. Graph Theory 10(3): 309-324 (1986) - 1985
- [j41]Carsten Thomassen:
The 2-linkage problem for acyclic digraphs. Discret. Math. 55(1): 73-87 (1985) - [j40]Carsten Thomassen:
Even Cycles in Directed Graphs. Eur. J. Comb. 6(1): 85-89 (1985) - [j39]Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen:
Cycles through four edges in 3-connected cubic graphs. Graphs Comb. 1(1): 7-11 (1985) - [j38]Carsten Thomassen:
Subgraphs with large degrees and girth. Graphs Comb. 1(1): 299-300 (1985) - [j37]Carsten Thomassen:
Gabriel andrew dirac. J. Graph Theory 9(3): 301-318 (1985) - 1984
- [j36]Carsten Thomassen:
A refinement of Kuratowski's theorem. J. Comb. Theory B 37(3): 245-253 (1984) - [j35]Carsten Thomassen:
Subdivisions of graphs with large minimum degree. J. Graph Theory 8(1): 23-28 (1984) - 1983
- [j34]Carsten Thomassen:
Cycles in graphs of uncountable chromatic number. Comb. 3(1): 133-134 (1983) - [j33]Carsten Thomassen:
Disjoint cycles in digraphs. Comb. 3(3): 393-396 (1983) - [j32]Carsten Thomassen:
Deformations of plane graphs. J. Comb. Theory B 34(3): 244-257 (1983) - [j31]Carsten Thomassen:
Girth in graphs. J. Comb. Theory B 35(2): 129-141 (1983) - [j30]Carsten Thomassen:
Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory 7(2): 165-167 (1983) - [j29]Carsten Thomassen:
A theorem on paths in planar graphs. J. Graph Theory 7(2): 169-176 (1983) - [j28]Carsten Thomassen:
Graph decomposition with applications to subdivisions and path systems modulo k. J. Graph Theory 7(2): 261-271 (1983) - 1982
- [j27]Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen:
A nine point theorem for 3-connected graphs. Comb. 2(1): 53-62 (1982) - [j26]Roland Häggkvist, Carsten Thomassen:
Circuits through specified edges. Discret. Math. 41(1): 29-34 (1982) - 1981
- [j25]Carsten Thomassen:
Planar cubic hypohamiltonian and hypotraceable graphs. J. Comb. Theory B 30(1): 36-44 (1981) - [j24]Béla Bollobás, Carsten Thomassen:
The size of connected hypergraphs with prescribed covering number. J. Comb. Theory B 31(2): 150-155 (1981) - [j23]Carsten Thomassen, Bjarne Toft:
Non-separating induced cycles in graphs. J. Comb. Theory B 31(2): 199-224 (1981) - [j22]Jean-Claude Bermond, Carsten Thomassen:
Cycles in digraphs- a survey. J. Graph Theory 5(1): 1-43 (1981) - [j21]Carsten Thomassen:
Kuratowski's theorem. J. Graph Theory 5(3): 225-241 (1981) - [j20]Carsten Thomassen:
Nonseparating cycles in K-Connected graphs. J. Graph Theory 5(4): 351-354 (1981) - [j19]Carsten Thomassen:
A remark on the factor theorems of lovász and tutte. J. Graph Theory 5(4): 441-442 (1981) - 1980
- [j18]Carsten Thomassen:
On the number of Hamiltonian cycles in tournaments. Discret. Math. 31(3): 315-323 (1980) - [j17]Carsten Thomassen:
2-Linked Graphs. Eur. J. Comb. 1(4): 371-378 (1980) - [j16]Carsten Thomassen:
Hamiltonian-connected tournaments. J. Comb. Theory B 28(2): 142-163 (1980) - [j15]Carsten Thomassen:
Planarity and duality of finite and infinite graphs. J. Comb. Theory B 29(2): 244-271 (1980) - [j14]Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi:
Hypotraceable digraphs. J. Graph Theory 4(4): 377-381 (1980)
1970 – 1979
- 1979
- [j13]Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen:
On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory 3(4): 365-370 (1979) - [j12]Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen:
Three-regular subgraphs of four-regular graphs. J. Graph Theory 3(4): 371-386 (1979) - 1978
- [j11]Carsten Thomassen:
On separating cycles in graphs. Discret. Math. 22(1): 57-73 (1978) - [j10]Carsten Thomassen:
Reconstructibility versus edge reconstructibility of infinite graphs. Discret. Math. 24(2): 231-233 (1978) - [j9]Vasek Chvátal, Carsten Thomassen:
Distances in orientations of graphs. J. Comb. Theory B 24(1): 61-75 (1978) - [j8]Carsten Thomassen:
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs. J. Graph Theory 2(4): 341-347 (1978) - 1977
- [j7]Carsten Thomassen:
An ore-type condition implying a digraph to be pancyclic. Discret. Math. 19(1): 85-92 (1977) - [j6]J. Adrian Bondy, Carsten Thomassen:
A short proof of Meyniel's theorem. Discret. Math. 19(2): 195-197 (1977) - [j5]Carsten Thomassen:
Counterexamples to the edge reconstruction conjecture for infinite graphs. Discret. Math. 19(3): 293-295 (1977) - [j4]Carsten Thomassen:
Note on circuits containing specified edges. J. Comb. Theory B 22(3): 279-280 (1977) - 1976
- [j3]Carsten Thomassen:
Planar and infinite hypohamiltonian and hypotraceable graphs. Discret. Math. 14(4): 377-389 (1976) - 1974
- [j2]Carsten Thomassen:
Hypohamiltonian and hypotraceable graphs. Discret. Math. 9(1): 91-96 (1974) - [j1]Carsten Thomassen:
On hypohamiltonian graphs. Discret. Math. 10(2): 383-390 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
