| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Carsten Thomassen |
The weak 3-flow conjecture and the weak circular flow conjecture.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP BibTeX RDF |
|
| 1 | Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen |
The maximum number of minimal codewords in long codes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | André Kündgen, Gregor Leander, Carsten Thomassen |
Switchings, extensions, and reductions in central digraphs. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Meysam Alishahi, Ali Taherkhani, Carsten Thomassen |
Rainbow Paths with Prescribed Ends. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | R. Bruce Richter, Brendan Rooney, Carsten Thomassen |
On planarity of compact, locally connected, metric spaces. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The chromatic polynomial and list colorings. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Carsten Thomassen |
Decomposing a planar graph of girth 5 into an independent set and a forest. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
2-List-coloring planar graphs without monochromatic triangles. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen, Antoine Vella |
Graph-like continua, augmenting arcs, and Menger's theorem. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Carsten Thomassen |
On the maximum number of cycles in a planar graph. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Decompositions of highly connected graphs into paths of length 3. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Many 3-colorings of triangle-free planar graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Exponentially many 5-list-colorings of planar graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Hajós' conjecture for line graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15 |
| 1 | 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 |
DBLP DOI BibTeX RDF |
Topics Parameterized Complexity, Graph Coloring, Bounded Treewidth |
| 1 | Carsten Thomassen |
The number of k-colorings of a graph on a fixed surface. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen |
Density Conditions For Triangles In Multipartite Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35 |
| 1 | Vojislav Petrovic, Carsten Thomassen |
Edge-disjoint Hamiltonian cycles in hypertournaments. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Rectangular and visibility representations of infinite planar graphs. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | János Barát, Carsten Thomassen |
Claw-decompositions and tutte-orientations. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Some remarks on Hajo's' conjecture. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Carsten Thomassen |
Graphs with not all possible path-kernels. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Locally Connected Compact Metric Spaces Embeddable In The Plane. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C10, 57M15 |
| 1 | Carsten Thomassen |
Classification Of Locally 2-Connected Compact Metric Spaces. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C10, 57M15 |
| 1 | Carsten Thomassen |
Tutte's spring theorem. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
A short list color proof of Grötzsch's theorem. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The chromatic number of a graph of girth 5 on a fixed surface. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Bojan Mohar, Carsten Thomassen |
Long Cycles in Graphs on a Fixed Surface. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
An intersection graph of straight lines. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C15, 05C35 |
| 1 | Carsten Thomassen |
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Totally Odd K4-subdivisions in 4-chromatic Graphs. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C15 |
| 1 | Carsten Thomassen |
The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C38, 05C40 |
| 1 | Carsten Thomassen |
Chromatic Roots and Hamiltonian Paths. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | John Gimbel, Carsten Thomassen |
Coloring triangle-free graphs with fixed size. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen |
Highly Connected Sets and the Excluded Grid Theorem. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Color-Critical Graphs on a Fixed Surface. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Carsten Thomassen |
On the Number of Cycles in 3-Connected Cubic Graphs. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Chords of Longest Cycles in Cubic Graphs. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Genus Problem for Cubic Graphs. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Dirac's conjecture on K5-subdivisions. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Zero-Free Intervals for Chromatic Polynomials of Graphs. |
Combinatorics, Probability & Computing |
1997 |
DBLP BibTeX RDF |
|
| 1 | Carsten Thomassen |
On the Complexity of Finding a Minimum Cycle Cover of a Graph. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
On the Number of Hamiltonian Cycles in Bipartite Graphs. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
K5-Subdivisions in Graphs. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
3-List-Coloring Planar Graphs of Girth 5. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Decomposing a Planar Graph into Degenerate Graphs. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Bruce Richter, Carsten Thomassen |
Intersections of Curve Systems and the Crossing Number of C5 X C5. |
Discrete & Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Every Planar Graph Is 5-Choosable. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Five-Coloring Graphs on the Torus. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Trees in Triangulations. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Embeddings of graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen, Wolfgang Woess |
Vertex-Transitive Graphs and Accessibility. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Triangulating a Surface with a Prescribed Graph. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Five-Coloring Maps on Surfaces. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Bruce Richter, Carsten Thomassen |
Minimal Graphs with Crossing Number at Least k. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Even Cycle Problem for Planar Digraphs. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Infinite connected graphs with no end-preserving spanning trees. |
J. Comb. Theory, Ser. B |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Plane Cubic Graphs with Prescribed Face Areas. |
Combinatorics, Probability & Computing |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen |
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. |
J. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Hadwiger number of subgroups vertex-transitive graphs. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Carsten Thomassen |
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojislav Petrovic, Carsten Thomassen |
Kings in k-partite tournaments. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Highly connected non-2-linked digraphs. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Bidirectional retracting-free double tracings and upper embeddability of graphs. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Resistances and currents in infinite electrical networks. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Embeddings of graphs with no short noncontractible cycles. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The Graph Genus Problem is NP-Complete. |
J. Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Arc reversals in tournaments. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Carsten Thomassen |
Characterization of even directed graphs. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Counterexamples to Adám's conjecture on arc reversals in directed graphs. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
A characterization of locally finite vertex-transitive graphs. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraisse, Carsten Thomassen |
Hamiltonian dicycles avoiding prescribed arcs in tournaments. |
Graphs and Combinatorics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
On digraphs with no two disjoint directed cycles. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Interval representations of planar graphs. |
J. Comb. Theory, Ser. B |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Gena Hahn, Carsten Thomassen |
Path and cycle sub-ramsey numbers and an edge-colouring conjecture. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
The 2-linkage problem for acyclic digraphs. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Subgraphs with large degrees and girth. |
Graphs and Combinatorics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen |
Cycles through four edges in 3-connected cubic graphs. |
Graphs and Combinatorics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
A refinement of Kuratowski's theorem. |
J. Comb. Theory, Ser. B |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Deformations of plane graphs. |
J. Comb. Theory, Ser. B |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Girth in graphs. |
J. Comb. Theory, Ser. B |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Disjoint cycles in digraphs. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Cycles in graphs of uncountable chromatic number. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Häggkvist, Carsten Thomassen |
Circuits through specified edges. |
Discrete Mathematics |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen |
A nine point theorem for 3-connected graphs. |
Combinatorica |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Planar cubic hypohamiltonian and hypotraceable graphs. |
J. Comb. Theory, Ser. B |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Planarity and duality of finite and infinite graphs. |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
Hamiltonian-connected tournaments. |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Thomassen |
On the number of Hamiltonian cycles in tournaments. |
Discrete Mathematics |
1980 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")