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