Carsten Thomassen

187 papers A* 1B 1C 1Journal 183

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Chords in longest cycles in 3-connected graphs. J. Comb. Theory B Carsten Thomassen
2026	J	`jnl`	The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup
2025	J	`jnl`	Edge-Connectivity Augmentation of Simple Graphs. SIAM J. Discret. Math. Kasper Skov Johansen, Eva Rotenberg, Carsten Thomassen
2024	J	`jnl`	Group coloring and group connectivity with non-isomorphic groups of the same order. Eur. J. Comb. Rikke Langhede, Carsten Thomassen
2023	J	`jnl`	Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles. J. Comb. Theory B Carsten Thomassen
2023	J	`jnl`	Ádám's conjecture. J. Comb. Theory B Carsten Thomassen
2022	B	`conf`	On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. MFCS Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen
2021	J	`jnl`	Exponentially many Z5-colorings in simple planar graphs. Discret. Math. Rikke Langhede, Carsten Thomassen
2020	J	`jnl`	Cycles containing all the odd-degree vertices. J. Comb. Theory B Kathie Cameron, Carsten Thomassen
2020	J	`jnl`	Cycles in 5-connected triangulations. J. Comb. Theory, Ser. B Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen
2020	J	`jnl`	Factorizing regular graphs. J. Comb. Theory B Carsten Thomassen
2020	J	`jnl`	Group Connectivity and Group Coloring: Small Groups versus Large Groups. Electron. J. Comb. Rikke Langhede, Carsten Thomassen
2020	J	`jnl`	Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface. Electron. J. Comb. James Davies, Carsten Thomassen
2019	J	`jnl`	Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM J. Discret. Math. John Gimbel, André Kündgen, Binlong Li, Carsten Thomassen
2019	J	`jnl`	Hamilton cycles in sparse locally connected graphs. Discret. Appl. Math. Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Carsten Thomassen, Johan P. de Wet
2019	J	`jnl`	Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. CoRR Klas Markström, Carsten Thomassen
2019	J	`jnl`	Planar Ramsey Graphs. Electron. J. Comb. Maria Axenovich, Ursula Schade, Carsten Thomassen, Torsten Ueckerdt
2018	A*	`conf`	A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen
2018	J	`jnl`	Chords in longest cycles. J. Comb. Theory B Carsten Thomassen
2018	J	`jnl`	Deciding Parity of Graph Crossing Number. SIAM J. Discret. Math. Petr Hlinený, Carsten Thomassen
2018	J	`jnl`	Density of Chromatic Roots in Minor-Closed Graph Families. Comb. Probab. Comput. Thomas J. Perrett, Carsten Thomassen
2018	J	`jnl`	Planar Ramsey graphs. CoRR Maria Axenovich, Carsten Thomassen, Ursula Schade, Torsten Ueckerdt
2018	J	`jnl`	The flow index and strongly connected orientations. Eur. J. Comb. Jiaao Li, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
2018	J	`jnl`	The square of a planar cubic graph is 7-colorable. J. Comb. Theory B Carsten Thomassen
2017	J	`jnl`	Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. André Kündgen, Binlong Li, Carsten Thomassen
2017	J	`jnl`	Decomposing graphs into a constant number of locally irregular subgraphs. Eur. J. Comb. Julien Bensmail, Martin Merker, Carsten Thomassen
2017	J	`jnl`	Infinitely connected subgraphs in graphs of uncountable chromatic number. Comb. Carsten Thomassen
2017	J	`jnl`	Nash-Williams' cycle-decomposition theorem. Comb. Carsten Thomassen
2017	J	`jnl`	On the Minimum Number of Spanning Trees in J. Graph Theory Seongmin Ok, Carsten Thomassen
2017	J	`jnl`	The number of colorings of planar graphs with no separating triangles. J. Comb. Theory B Carsten Thomassen
2016	J	`jnl`	Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. Graphs Comb. Seongmin Ok, R. Bruce Richter, Carsten Thomassen
2016	J	`jnl`	Orientations of infinite graphs with prescribed edge-connectivity. Comb. Carsten Thomassen
2016	J	`jnl`	The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J. Comb. Theory B Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
2015	J	`jnl`	Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, Bernardo Llano, Carsten Thomassen, Rita Zuazua
2015	J	`jnl`	Extending a perfect matching to a Hamiltonian cycle. Discret. Math. Theor. Comput. Sci. Adel Alahmadi, Robert E. L. Aldred, Ahmad Alkenani, Rola Hijazi, Patrick Solé, Carsten Thomassen
2015	J	`jnl`	Strongly 2-connected orientations of graphs. J. Comb. Theory B Carsten Thomassen
2015	J	`jnl`	The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen
2014	J	`jnl`	Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces". Comb. R. Bruce Richter, Brendan Rooney, Carsten Thomassen
2014	J	`jnl`	Graph factors modulo k. J. Comb. Theory B Carsten Thomassen
2014	J	`jnl`	Group flow, complex flow, unit vector flow, and the (2+ε)-flow conjecture. J. Comb. Theory B Carsten Thomassen
2013	J	`jnl`	Decomposing a graph into bistars. J. Comb. Theory B Carsten Thomassen
2013	J	`jnl`	Decomposing graphs into paths of fixed length. Comb. Carsten Thomassen
2013	J	`jnl`	Nowhere-zero 3-flows and modulo k-orientations. J. Comb. Theory B László Miklós Lovász, Carsten Thomassen, Yezhou Wu, Cun-Quan Zhang
2013	J	`jnl`	The maximum number of minimal codewords in an [ Discret. Math. Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
2013	J	`jnl`	The maximum number of minimal codewords in long codes. Discret. Appl. Math. Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
2012	J	`jnl`	From the plane to higher surfaces. J. Comb. Theory B Ken-ichi Kawarabayashi, Carsten Thomassen
2012	J	`jnl`	On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. Gek Ling Chia, Carsten Thomassen
2012	J	`jnl`	The maximum number of minimal codewords in an $[n,k]-$code CoRR Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
2012	J	`jnl`	The maximum number of minimal codewords in long codes CoRR Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen
2012	J	`jnl`	The weak 3-flow conjecture and the weak circular flow conjecture. J. Comb. Theory B Carsten Thomassen
2011	J	`jnl`	Grinberg's Criterion Applied to Some Non-Planar Graphs. Ars Comb. Gek Ling Chia, Carsten Thomassen
2011	J	`jnl`	On planarity of compact, locally connected, metric spaces. Comb. R. Bruce Richter, Brendan Rooney, Carsten Thomassen
2011	J	`jnl`	On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011	J	`jnl`	Rainbow Paths with Prescribed Ends. Electron. J. Comb. Meysam Alishahi, Ali Taherkhani, Carsten Thomassen
2011	J	`jnl`	Switchings, extensions, and reductions in central digraphs. J. Comb. Theory A André Kündgen, Gregor Leander, Carsten Thomassen
2009	J	`jnl`	Decomposing a planar graph of girth 5 into an independent set and a forest. J. Comb. Theory B Ken-ichi Kawarabayashi, Carsten Thomassen
2009	J	`jnl`	The chromatic polynomial and list colorings. J. Comb. Theory B Carsten Thomassen
2008	J	`jnl`	2-List-coloring planar graphs without monochromatic triangles. J. Comb. Theory B Carsten Thomassen
2008	J	`jnl`	Decompositions of highly connected graphs into paths of length 3. J. Graph Theory Carsten Thomassen
2008	J	`jnl`	Graph-like continua, augmenting arcs, and Menger's theorem. Comb. Carsten Thomassen, Antoine Vella
2008	J	`jnl`	On the maximum number of cycles in a planar graph. J. Graph Theory Robert E. L. Aldred, Carsten Thomassen
2007	J	`jnl`	Exponentially many 5-list-colorings of planar graphs. J. Comb. Theory B Carsten Thomassen
2007	J	`jnl`	Hajós' conjecture for line graphs. J. Comb. Theory B Carsten Thomassen
2007	J	`jnl`	Many 3-colorings of triangle-free planar graphs. J. Comb. Theory B Carsten Thomassen
2007	J	`jnl`	On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree. Comb. Carsten Thomassen
2007	C	`conf`	On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2006	J	`jnl`	A Cantor-Bernstein Theorem for Paths in Graphs. Am. Math. Mon. Reinhard Diestel, Carsten Thomassen
2006	J	`jnl`	Claw-decompositions and tutte-orientations. J. Graph Theory János Barát, Carsten Thomassen
2006	J	`jnl`	Density Conditions For Triangles In Multipartite Graphs. Comb. J. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen
2006	J	`jnl`	Edge-disjoint Hamiltonian cycles in hypertournaments. J. Graph Theory Vojislav Petrovic, Carsten Thomassen
2006	J	`jnl`	On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. J. Graph Theory Carsten Thomassen
2006	J	`jnl`	Rectangular and visibility representations of infinite planar graphs. J. Graph Theory Carsten Thomassen
2006	J	`jnl`	The number of k-colorings of a graph on a fixed surface. Discret. Math. Carsten Thomassen
2005	J	`jnl`	Some remarks on Hajo's' conjecture. J. Comb. Theory B Carsten Thomassen
2004	J	`jnl`	Classification Of Locally 2-Connected Compact Metric Spaces. Comb. Carsten Thomassen
2004	J	`jnl`	Graphs with not all possible path-kernels. Discret. Math. Robert E. L. Aldred, Carsten Thomassen
2004	J	`jnl`	The Locally Connected Compact Metric Spaces Embeddable In The Plane. Comb. Carsten Thomassen
2004	J	`jnl`	Tutte's spring theorem. J. Graph Theory Carsten Thomassen
2003	J	`jnl`	A short list color proof of Grötzsch's theorem. J. Comb. Theory B Carsten Thomassen
2003	J	`jnl`	The chromatic number of a graph of girth 5 on a fixed surface. J. Comb. Theory B Carsten Thomassen
2002	J	`jnl`	An intersection graph of straight lines. Discret. Math. Carsten Thomassen
2002	J	`jnl`	Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory B Thomas Böhme, Bojan Mohar, Carsten Thomassen
2002	J	`jnl`	On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree. Comb. Carsten Thomassen
2001	J	`jnl`	Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. J. Comb. Theory B Carsten Thomassen
2001	—	`book`	Graphs on Surfaces. Bojan Mohar, Carsten Thomassen
2001	J	`jnl`	The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. Comb. Carsten Thomassen
2001	J	`jnl`	Totally Odd Comb. Carsten Thomassen
2000	J	`jnl`	Chromatic Roots and Hamiltonian Paths. J. Comb. Theory B Carsten Thomassen
2000	J	`jnl`	Coloring triangle-free graphs with fixed size. Discret. Math. John Gimbel, Carsten Thomassen
2000	J	`jnl`	The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space. Am. Math. Mon. Carsten Thomassen
2000	J	`jnl`	The color space of a graph. J. Graph Theory Tommy R. Jensen, Carsten Thomassen
1999	J	`jnl`	Highly Connected Sets and the Excluded Grid Theorem. J. Comb. Theory B Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
1999	J	`jnl`	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 Carsten Thomassen
1998	J	`jnl`	Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs. J. Comb. Theory B Carsten Thomassen
1997	J	`jnl`	A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces. J. Comb. Theory B Carsten Thomassen
1997	J	`jnl`	Chords of Longest Cycles in Cubic Graphs. J. Comb. Theory B Carsten Thomassen
1997	J	`jnl`	Color-Critical Graphs on a Fixed Surface. J. Comb. Theory B Carsten Thomassen
1997	J	`jnl`	Dirac's conjecture on K Discret. Math. Carsten Thomassen
1997	J	`jnl`	On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM J. Comput. Carsten Thomassen
1997	J	`jnl`	On the Number of Cycles in 3-Connected Cubic Graphs. J. Comb. Theory B Robert E. L. Aldred, Carsten Thomassen
1997	J	`jnl`	The Genus Problem for Cubic Graphs. J. Comb. Theory B Carsten Thomassen
1997	J	`jnl`	The Zero-Free Intervals for Chromatic Polynomials of Graphs. Comb. Probab. Comput. Carsten Thomassen
1996	J	`jnl`	Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs. J. Comb. Theory B Carsten Thomassen
1996	J	`jnl`	K5-Subdivisions in Graphs. Comb. Probab. Comput. Carsten Thomassen
1996	J	`jnl`	On the Number of Hamiltonian Cycles in Bipartite Graphs. Comb. Probab. Comput. Carsten Thomassen
1995	J	`jnl`	3-List-Coloring Planar Graphs of Girth 5. J. Comb. Theory B Carsten Thomassen
1995	J	`jnl`	Decomposing a Planar Graph into Degenerate Graphs. J. Comb. Theory B Carsten Thomassen
1995	J	`jnl`	Intersections of Curve Systems and the Crossing Number of C Discret. Comput. Geom. R. Bruce Richter, Carsten Thomassen
1994	J	`jnl`	Editorial. J. Graph Theory Carsten Thomassen, Edward R. Scheinerman
1994	J	`jnl`	Embeddings of graphs. Discret. Math. Carsten Thomassen
1994	J	`jnl`	Every Planar Graph Is 5-Choosable. J. Comb. Theory B Carsten Thomassen
1994	J	`jnl`	Five-Coloring Graphs on the Torus. J. Comb. Theory B Carsten Thomassen
1994	J	`jnl`	Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane. J. Comb. Theory B Carsten Thomassen
1994	J	`jnl`	Trees in Triangulations. J. Comb. Theory B Carsten Thomassen
1993	J	`jnl`	Five-Coloring Maps on Surfaces. J. Comb. Theory B Carsten Thomassen
1993	J	`jnl`	Minimal Graphs with Crossing Number at Least J. Comb. Theory B R. Bruce Richter, Carsten Thomassen
1993	J	`jnl`	The Even Cycle Problem for Planar Digraphs. J. Algorithms Carsten Thomassen
1993	J	`jnl`	Triangulating a Surface with a Prescribed Graph. J. Comb. Theory B Carsten Thomassen
1993	J	`jnl`	Vertex-Transitive Graphs and Accessibility. J. Comb. Theory B Carsten Thomassen, Wolfgang Woess
1992	J	`jnl`	A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen
1992	J	`jnl`	A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Carsten Thomassen
1992	J	`jnl`	Infinite connected graphs with no end-preserving spanning trees. J. Comb. Theory B Carsten Thomassen
1992	J	`jnl`	Plane Cubic Graphs with Prescribed Face Areas. Comb. Probab. Comput. Carsten Thomassen
1992	J	`jnl`	The Hadwiger number of subgroups vertex-transitive graphs. Comb. Carsten Thomassen
1991	J	`jnl`	Highly connected non-2-linked digraphs. Comb. Carsten Thomassen
1991	J	`jnl`	Kings in k-partite tournaments. Discret. Math. Vojislav Petrovic, Carsten Thomassen
1990	J	`jnl`	Bidirectional retracting-free double tracings and upper embeddability of graphs. J. Comb. Theory B Carsten Thomassen
1990	J	`jnl`	Embeddings of graphs with no short noncontractible cycles. J. Comb. Theory B Carsten Thomassen
1990	J	`jnl`	Graphs with homeomorphically irreducible spanning trees. J. Graph Theory Michael O. Albertson, David M. Berman, Joan P. Hutchinson, Carsten Thomassen
1990	J	`jnl`	Resistances and currents in infinite electrical networks. J. Comb. Theory B Carsten Thomassen
1989	J	`jnl`	Infinite, highly connected digraphs with no two arc-disjoint spanning trees. J. Graph Theory Ron Aharoni, Carsten Thomassen
1989	J	`jnl`	The Graph Genus Problem is NP-Complete. J. Algorithms Carsten Thomassen
1989	J	`jnl`	Tight bounds on the chromatic sum of a connected graph. J. Graph Theory Carsten Thomassen, Paul Erdös, Yousef Alavi, Paresh J. Malde, Allen J. Schwenk
1989	J	`jnl`	Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs. J. Comb. Theory B Carsten Thomassen
1988	J	`jnl`	Arc reversals in tournaments. Discret. Math. Carsten Thomassen
1988	J	`jnl`	On the presence of disjoint subgraphs of a specified type. J. Graph Theory Carsten Thomassen
1988	J	`jnl`	Rectilinear drawings of graphs. J. Graph Theory Carsten Thomassen
1987	J	`jnl`	A characterization of locally finite vertex-transitive graphs. J. Comb. Theory B Carsten Thomassen
1987	J	`jnl`	Characterization of even directed graphs. J. Comb. Theory B Paul D. Seymour, Carsten Thomassen
1987	J	`jnl`	Counterexamples to Adám's conjecture on arc reversals in directed graphs. J. Comb. Theory B Carsten Thomassen
1987	J	`jnl`	Hamiltonian dicycles avoiding prescribed arcs in tournaments. Graphs Comb. Pierre Fraisse, Carsten Thomassen
1987	J	`jnl`	On digraphs with no two disjoint directed cycles. Comb. Carsten Thomassen
1987	J	`jnl`	Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
1986	J	`jnl`	Interval representations of planar graphs. J. Comb. Theory B Carsten Thomassen
1986	J	`jnl`	Path and cycle sub-ramsey numbers and an edge-colouring conjecture. Discret. Math. Gena Hahn, Carsten Thomassen
1986	J	`jnl`	Reflections on graph theory. J. Graph Theory Carsten Thomassen
1985	J	`jnl`	Cycles through four edges in 3-connected cubic graphs. Graphs Comb. Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen
1985	J	`jnl`	Even Cycles in Directed Graphs. Eur. J. Comb. Carsten Thomassen
1985	J	`jnl`	Gabriel andrew dirac. J. Graph Theory Carsten Thomassen
1985	J	`jnl`	Subgraphs with large degrees and girth. Graphs Comb. Carsten Thomassen
1985	J	`jnl`	The 2-linkage problem for acyclic digraphs. Discret. Math. Carsten Thomassen
1984	J	`jnl`	A refinement of Kuratowski's theorem. J. Comb. Theory B Carsten Thomassen
1984	J	`jnl`	Subdivisions of graphs with large minimum degree. J. Graph Theory Carsten Thomassen
1983	J	`jnl`	A theorem on paths in planar graphs. J. Graph Theory Carsten Thomassen
1983	J	`jnl`	Cycles in graphs of uncountable chromatic number. Comb. Carsten Thomassen
1983	J	`jnl`	Deformations of plane graphs. J. Comb. Theory B Carsten Thomassen
1983	J	`jnl`	Disjoint cycles in digraphs. Comb. Carsten Thomassen
1983	J	`jnl`	Girth in graphs. J. Comb. Theory B Carsten Thomassen
1983	J	`jnl`	Graph decomposition with applications to subdivisions and path systems modulo J. Graph Theory Carsten Thomassen
1983	J	`jnl`	Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory Carsten Thomassen
1982	J	`jnl`	A nine point theorem for 3-connected graphs. Comb. Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
1982	J	`jnl`	Circuits through specified edges. Discret. Math. Roland Häggkvist, Carsten Thomassen
1981	J	`jnl`	A remark on the factor theorems of lovász and tutte. J. Graph Theory Carsten Thomassen
1981	J	`jnl`	Cycles in digraphs- a survey. J. Graph Theory Jean-Claude Bermond, Carsten Thomassen
1981	J	`jnl`	Kuratowski's theorem. J. Graph Theory Carsten Thomassen
1981	J	`jnl`	Non-separating induced cycles in graphs. J. Comb. Theory B Carsten Thomassen, Bjarne Toft
1981	J	`jnl`	Nonseparating cycles in J. Graph Theory Carsten Thomassen
1981	J	`jnl`	Planar cubic hypohamiltonian and hypotraceable graphs. J. Comb. Theory B Carsten Thomassen
1981	J	`jnl`	The size of connected hypergraphs with prescribed covering number. J. Comb. Theory B Béla Bollobás, Carsten Thomassen
1980	J	`jnl`	2-Linked Graphs. Eur. J. Comb. Carsten Thomassen
1980	J	`jnl`	Hamiltonian-connected tournaments. J. Comb. Theory B Carsten Thomassen
1980	J	`jnl`	Hypotraceable digraphs. J. Graph Theory Martin Grötschel, Carsten Thomassen, Yoshiko Wakabayashi
1980	J	`jnl`	On the number of Hamiltonian cycles in tournaments. Discret. Math. Carsten Thomassen
1980	J	`jnl`	Planarity and duality of finite and infinite graphs. J. Comb. Theory B Carsten Thomassen
1979	J	`jnl`	On the number of hamiltonian cycles in a maximal planar graph. J. Graph Theory Seifollah Louis Hakimi, Edward F. Schmeichel, Carsten Thomassen
1979	J	`jnl`	Three-regular subgraphs of four-regular graphs. J. Graph Theory Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen
1978	J	`jnl`	Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs. J. Graph Theory Carsten Thomassen
1978	J	`jnl`	Distances in orientations of graphs. J. Comb. Theory B Vasek Chvátal, Carsten Thomassen
1978	J	`jnl`	On separating cycles in graphs. Discret. Math. Carsten Thomassen
1978	J	`jnl`	Reconstructibility versus edge reconstructibility of infinite graphs. Discret. Math. Carsten Thomassen
1977	J	`jnl`	A short proof of Meyniel's theorem. Discret. Math. J. Adrian Bondy, Carsten Thomassen
1977	J	`jnl`	An ore-type condition implying a digraph to be pancyclic. Discret. Math. Carsten Thomassen
1977	J	`jnl`	Counterexamples to the edge reconstruction conjecture for infinite graphs. Discret. Math. Carsten Thomassen
1977	J	`jnl`	Note on circuits containing specified edges. J. Comb. Theory B Carsten Thomassen
1976	J	`jnl`	Planar and infinite hypohamiltonian and hypotraceable graphs. Discret. Math. Carsten Thomassen
1974	J	`jnl`	Hypohamiltonian and hypotraceable graphs. Discret. Math. Carsten Thomassen
1974	J	`jnl`	On hypohamiltonian graphs. Discret. Math. Carsten Thomassen