Search the dblp DataBase
Carsten Thomassen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Adrian Bondy , Jian Shen , Stéphan Thomassé , Carsten Thomassen Density Conditions For Triangles In Multipartite Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2006, v:26, n:2, pp:121-131 [Journal ] Derek A. Holton , Brendan D. McKay , Michael D. Plummer , Carsten Thomassen A nine point theorem for 3-connected graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1982, v:2, n:1, pp:53-62 [Journal ] Carsten Thomassen The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2001, v:21, n:2, pp:321-333 [Journal ] Carsten Thomassen Totally Odd K 4 -subdivisions in 4-chromatic Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2001, v:21, n:3, pp:417-443 [Journal ] Carsten Thomassen On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2002, v:22, n:4, pp:591-596 [Journal ] Carsten Thomassen The Locally Connected Compact Metric Spaces Embeddable In The Plane. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:4, pp:699-718 [Journal ] Carsten Thomassen Classification Of Locally 2-Connected Compact Metric Spaces. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:25, n:1, pp:85-103 [Journal ] Carsten Thomassen Cycles in graphs of uncountable chromatic number. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:1, pp:133-134 [Journal ] Carsten Thomassen Disjoint cycles in digraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:3, pp:393-396 [Journal ] Carsten Thomassen On digraphs with no two disjoint directed cycles. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1987, v:7, n:1, pp:145-150 [Journal ] Carsten Thomassen Highly connected non-2-linked digraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:4, pp:393-395 [Journal ] Carsten Thomassen The Hadwiger number of subgroups vertex-transitive graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1992, v:12, n:4, pp:481-492 [Journal ] Carsten Thomassen Plane Cubic Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:371-381 [Journal ] Carsten Thomassen K5-Subdivisions in Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:179-189 [Journal ] Carsten Thomassen On the Number of Hamiltonian Cycles in Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:437-442 [Journal ] Carsten Thomassen The Zero-Free Intervals for Chromatic Polynomials of Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1997, v:6, n:4, pp:497-506 [Journal ] R. Bruce Richter , Carsten Thomassen Intersections of Curve Systems and the Crossing Number of C5 X C5 . [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1995, v:13, n:, pp:149-159 [Journal ] Robert E. L. Aldred , Carsten Thomassen Graphs with not all possible path-kernels. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:285, n:1-3, pp:297-300 [Journal ] John Gimbel , Carsten Thomassen Coloring triangle-free graphs with fixed size. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:219, n:1-3, pp:275-277 [Journal ] Carsten Thomassen An intersection graph of straight lines. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:359-360 [Journal ] Carsten Thomassen The number of k-colorings of a graph on a fixed surface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3145-3153 [Journal ] Jørgen Bang-Jensen , Yannis Manoussakis , Carsten Thomassen A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1992, v:13, n:1, pp:114-127 [Journal ] Carsten Thomassen The Graph Genus Problem is NP-Complete. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1989, v:10, n:4, pp:568-576 [Journal ] Carsten Thomassen The Even Cycle Problem for Planar Digraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:1, pp:61-75 [Journal ] Robert E. L. Aldred , Carsten Thomassen On the Number of Cycles in 3-Connected Cubic Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:79-84 [Journal ] Thomas Böhme , Bojan Mohar , Carsten Thomassen Long Cycles in Graphs on a Fixed Surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:338-347 [Journal ] Reinhard Diestel , Tommy R. Jensen , Konstantin Yu. Gorbunov , Carsten Thomassen Highly Connected Sets and the Excluded Grid Theorem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:61-73 [Journal ] R. Bruce Richter , Carsten Thomassen Minimal Graphs with Crossing Number at Least k . [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:217-224 [Journal ] Paul D. Seymour , Carsten Thomassen Characterization of even directed graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:36-45 [Journal ] Carsten Thomassen Chromatic Roots and Hamiltonian Paths. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:218-224 [Journal ] Carsten Thomassen Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:262-271 [Journal ] Carsten Thomassen A short list color proof of Grötzsch's theorem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:189-192 [Journal ] Carsten Thomassen The chromatic number of a graph of girth 5 on a fixed surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:38-71 [Journal ] Carsten Thomassen Some remarks on Hajo's' conjecture. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2005, v:93, n:1, pp:95-105 [Journal ] Carsten Thomassen Girth in graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:35, n:2, pp:129-141 [Journal ] Carsten Thomassen Deformations of plane graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:244-257 [Journal ] Carsten Thomassen A refinement of Kuratowski's theorem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:245-253 [Journal ] Carsten Thomassen Interval representations of planar graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:9-20 [Journal ] Carsten Thomassen A characterization of locally finite vertex-transitive graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1987, v:43, n:1, pp:116-119 [Journal ] Carsten Thomassen Counterexamples to Adám's conjecture on arc reversals in directed graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:128-130 [Journal ] Carsten Thomassen Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1989, v:46, n:3, pp:257-291 [Journal ] Carsten Thomassen Bidirectional retracting-free double tracings and upper embeddability of graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:198-207 [Journal ] Carsten Thomassen Resistances and currents in infinite electrical networks. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:87-102 [Journal ] Carsten Thomassen Embeddings of graphs with no short noncontractible cycles. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:155-177 [Journal ] Carsten Thomassen Infinite connected graphs with no end-preserving spanning trees. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:322-324 [Journal ] Carsten Thomassen Five-Coloring Maps on Surfaces. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:89-105 [Journal ] Carsten Thomassen Triangulating a Surface with a Prescribed Graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:57, n:2, pp:196-206 [Journal ] Carsten Thomassen Five-Coloring Graphs on the Torus. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:11-33 [Journal ] Carsten Thomassen Every Planar Graph Is 5-Choosable. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:180-181 [Journal ] Carsten Thomassen Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:268-279 [Journal ] Carsten Thomassen Trees in Triangulations. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1994, v:60, n:1, pp:56-62 [Journal ] Carsten Thomassen Decomposing a Planar Graph into Degenerate Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:65, n:2, pp:305-314 [Journal ] Carsten Thomassen 3-List-Coloring Planar Graphs of Girth 5. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:101-107 [Journal ] Carsten Thomassen Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:24-33 [Journal ] Carsten Thomassen Chords of Longest Cycles in Cubic Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:211-214 [Journal ] Carsten Thomassen Color-Critical Graphs on a Fixed Surface. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:67-100 [Journal ] Carsten Thomassen A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:306-311 [Journal ] Carsten Thomassen The Genus Problem for Cubic Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:69, n:1, pp:52-58 [Journal ] Carsten Thomassen Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:104-109 [Journal ] Carsten Thomassen Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:100-109 [Journal ] Carsten Thomassen , Wolfgang Woess Vertex-Transitive Graphs and Accessibility. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:248-268 [Journal ] Carsten Thomassen Hajós' conjecture for line graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:156-157 [Journal ] Carsten Thomassen Many 3-colorings of triangle-free planar graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:334-349 [Journal ] Carsten Thomassen Planar cubic hypohamiltonian and hypotraceable graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:36-44 [Journal ] Carsten Thomassen Planarity and duality of finite and infinite graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1980, v:29, n:2, pp:244-271 [Journal ] Carsten Thomassen Hamiltonian-connected tournaments. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:142-163 [Journal ] Vasek Chvátal , Carsten Thomassen Distances in orientations of graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:24, n:1, pp:61-75 [Journal ] Carsten Thomassen Note on circuits containing specified edges. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:279-280 [Journal ] Carsten Thomassen On the Complexity of Finding a Minimum Cycle Cover of a Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:675-677 [Journal ] Jørgen Bang-Jensen , Carsten Thomassen A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1992, v:5, n:3, pp:366-376 [Journal ] Vojislav Petrovic , Carsten Thomassen Edge-disjoint Hamiltonian cycles in hypertournaments. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:51, n:1, pp:49-52 [Journal ] János Barát , Carsten Thomassen Claw-decompositions and tutte-orientations. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:52, n:2, pp:135-146 [Journal ] Carsten Thomassen Rectangular and visibility representations of infinite planar graphs. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:52, n:3, pp:257-265 [Journal ] Carsten Thomassen On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:53, n:4, pp:261-269 [Journal ] Carsten Thomassen Tutte's spring theorem. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2004, v:45, n:4, pp:275-280 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] COCOA, 2007, pp:366-377 [Conf ] Carsten Thomassen On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2007, v:27, n:2, pp:241-243 [Journal ] Carsten Thomassen On the number of Hamiltonian cycles in tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1980, v:31, n:3, pp:315-323 [Journal ] Roland Häggkvist , Carsten Thomassen Circuits through specified edges. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1982, v:41, n:1, pp:29-34 [Journal ] Carsten Thomassen The 2-linkage problem for acyclic digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:55, n:1, pp:73-87 [Journal ] Gena Hahn , Carsten Thomassen Path and cycle sub-ramsey numbers and an edge-colouring conjecture. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:62, n:1, pp:29-33 [Journal ] Carsten Thomassen Arc reversals in tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:71, n:1, pp:73-86 [Journal ] Carsten Thomassen Dirac's conjecture on K5 -subdivisions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:165, n:, pp:607-608 [Journal ] Vojislav Petrovic , Carsten Thomassen Kings in k-partite tournaments. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:98, n:3, pp:237-238 [Journal ] Carsten Thomassen Embeddings of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:124, n:1-3, pp:217-228 [Journal ] Carsten Thomassen Exponentially many 5-list-colorings of planar graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:571-583 [Journal ] Graph-like continua, augmenting arcs, and Menger's theorem. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.010secs