Person:228790: Difference between revisions

From MaRDI portal
Person:228790
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Carsten Thomassen to Carsten Thomassen: Duplicate
 
(No difference)

Latest revision as of 16:15, 9 December 2023

Available identifiers

zbMath Open thomassen.carstenDBLP66/1029WikidataQ1045720 ScholiaQ1045720MaRDI QIDQ228790

List of research outcomes





PublicationDate of PublicationType
Edge-connectivity augmentation of simple graphs2025-01-22Paper
On dynamic \(\alpha+1\) Arboricity decomposition and out-orientation2024-08-06Paper
Group coloring and group connectivity with non-isomorphic groups of the same order2024-06-28Paper
Ádám's conjecture2023-05-02Paper
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles2022-11-23Paper
Orientations of infinite graphs with prescribed edge-connectivity2022-06-29Paper
4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles2022-02-08Paper
Linear transformations of tropical matrices preserving the cyclicity index2021-12-17Paper
Universality in minor-closed graph classes2021-09-01Paper
Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices2021-07-23Paper
Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs2021-07-08Paper
Locally Hamiltonian graphs and minimal size of maximal graphs on a surface2020-06-04Paper
Cycles containing all the odd-degree vertices2020-04-22Paper
Group connectivity and group coloring: small groups versus large groups2020-03-30Paper
Cycles in 5-connected triangulations2020-01-15Paper
Factorizing regular graphs2020-01-15Paper
Planar Ramsey graphs2019-10-14Paper
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces2019-08-29Paper
Hamilton cycles in sparse locally connected graphs2019-03-11Paper
Nash-Williams' cycle-decomposition theorem2019-02-01Paper
Density of Chromatic Roots in Minor-Closed Graph Families2018-11-09Paper
Deciding Parity of Graph Crossing Number2018-08-07Paper
The flow index and strongly connected orientations2018-04-25Paper
https://portal.mardi4nfdi.de/entity/Q46079962018-03-15Paper
Orientations of infinite graphs with prescribed edge-connectivity2018-02-22Paper
Infinitely connected subgraphs in graphs of uncountable chromatic number2018-02-12Paper
Chords in longest cycles2018-02-09Paper
Spanning quadrangulations of triangulated surfaces2018-01-05Paper
The square of a planar cubic graph is 7-colorable2017-11-28Paper
Cycles through all finite vertex sets in infinite graphs2017-08-31Paper
On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs2017-04-21Paper
Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity2017-01-13Paper
The number of colorings of planar graphs with no separating triangles2016-11-25Paper
Decomposing graphs into a constant number of locally irregular subgraphs2016-11-07Paper
The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture2016-10-12Paper
Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs2016-05-25Paper
Destroying longest cycles in graphs and digraphs2015-05-22Paper
https://portal.mardi4nfdi.de/entity/Q52492392015-04-30Paper
The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes]2015-04-28Paper
Addendum: Commentary for ``On planarity of compact, locally connected, metric spaces2015-01-09Paper
Strongly 2-connected orientations of graphs2014-11-21Paper
Decomposing a graph into bistars2014-10-16Paper
Nowhere-zero 3-flows and modulo \(k\)-orientations2014-10-13Paper
Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture2014-09-04Paper
Graph factors modulo \(k\)2014-08-28Paper
Decomposing graphs into paths of fixed length2014-05-05Paper
The maximum number of minimal codewords in an \([n,k\)-code]2014-01-17Paper
https://portal.mardi4nfdi.de/entity/Q49097022013-03-21Paper
The maximum number of minimal codewords in long codes2013-01-18Paper
https://portal.mardi4nfdi.de/entity/Q31664312012-10-12Paper
From the plane to higher surfaces2012-08-14Paper
The weak 3-flow conjecture and the weak circular flow conjecture2012-05-04Paper
On planarity of compact, locally connected, metric spaces2011-12-20Paper
Switchings, extensions, and reductions in central digraphs2011-07-07Paper
Spanning trees and orientation of graphs2011-06-14Paper
Rainbow paths with prescribed ends2011-06-01Paper
On the complexity of some colorful problems parameterized by treewidth2011-02-21Paper
Edge-decompositions of highly connected graphs into paths2009-10-26Paper
Graph-like continua, augmenting arcs, and Menger's theorem2009-07-20Paper
Decomposing a planar graph of girth 5 into an independent set and a forest2009-06-23Paper
Decompositions of highly connected graphs into paths of length 32009-06-04Paper
https://portal.mardi4nfdi.de/entity/Q36157912009-03-24Paper
The chromatic polynomial and list colorings2009-03-04Paper
On the Complexity of Some Colorful Problems Parameterized by Treewidth2009-03-03Paper
2-list-coloring planar graphs without monochromatic triangles2008-12-08Paper
On the maximum number of cycles in a planar graph2008-03-20Paper
A Cantor-Bernstein Theorem for Paths in Graphs2008-02-05Paper
On the chromatic number of pentagon-free graphs of large minimum degree2007-11-12Paper
Exponentially many 5-list-colorings of planar graphs2007-06-08Paper
Many 3-colorings of triangle-free planar graphs2007-04-16Paper
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation2007-02-02Paper
Hajós' conjecture for line graphs2007-01-11Paper
Density conditions for triangles in multipartite graphs2007-01-08Paper
The number of \(k\)-colorings of a graph on a fixed surface2006-12-14Paper
Rectangular and visibility representations of infinite planar graphs2006-09-06Paper
Claw‐decompositions and tutte‐orientations2006-06-06Paper
Edge-disjoint Hamiltonian cycles in hypertournaments2006-03-24Paper
The locally connected compact metric spaces embeddable in the plane2005-10-04Paper
Classification of locally 2-connected compact metric spaces2005-10-04Paper
Some remarks on Hajós' conjecture2005-02-09Paper
Graphs with not all possible path-kernels2004-08-19Paper
Quadrangulations and 4-color-critical graphs2004-08-06Paper
Tutte's spring theorem2004-03-29Paper
On the chromatic number of triangle-free graphs of large minimum degree2003-10-14Paper
A short list color proof of Grötzsch's theorem2003-08-25Paper
The chromatic number of a graph of girth 5 on a fixed surface2003-08-20Paper
An intersection graph of straight lines2003-03-16Paper
Chromatic roots and Hamiltonian paths2002-12-10Paper
Decomposing a planar graph into an independent set and a 3-degenerate graph2002-12-10Paper
Long cycles in graphs on a fixed surface2002-12-10Paper
3-connected planar spaces uniquely embed in the sphere2002-10-07Paper
The Erdős-Pósa property for odd cycles in graphs of large connectivity2002-02-13Paper
Totally odd \(K_4\)-subdivisions in 4-chromatic graphs2002-02-13Paper
On the Nelson Unit Distance Coloring Problem2001-11-26Paper
The Rendezvous Number of a Symmetric Matrix and a Compact Connected Metric Space2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q27267402001-07-18Paper
The color space of a graph2001-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45430312001-01-01Paper
Highly connected sets and the excluded grid theorem2000-11-29Paper
Coloring triangle-free graphs with fixed size2000-11-19Paper
https://portal.mardi4nfdi.de/entity/Q42636632000-02-16Paper
Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 51999-10-04Paper
Chords of longest cycles in cubic graphs1999-01-14Paper
Independent dominating sets and a second hamiltonian cycle in regular graphs1998-09-06Paper
Finite metric spaces of strictly negative type1998-08-12Paper
On the number of cycles in 3-connected cubic graphs1998-08-10Paper
The Zero-Free Intervals for Chromatic Polynomials of Graphs1998-05-06Paper
Color-critical graphs on a fixed surface1998-02-22Paper
Coloring graphs with fixed genus and girth1997-12-16Paper
Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs1997-10-07Paper
Dirac's conjecture on \(K_ 5\)-subdivisions1997-09-09Paper
The genus problem for cubic graphs1997-08-31Paper
On the Number of Hamiltonian Cycles in Bipartite Graphs1997-08-18Paper
A simpler proof of the excluded minor theorem for higher surfaces1997-08-12Paper
On the Complexity of Finding a Minimum Cycle Cover of a Graph1997-05-26Paper
K5-Subdivisions in Graphs1996-11-12Paper
Directed cycles with two chords and strong spanning directed subgraphs with few arcs1996-07-17Paper
Decomposing a planar graph into degenerate graphs1996-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48737791996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48717531996-04-08Paper
3-list-coloring planar graphs of girth 51995-07-04Paper
Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)1995-05-17Paper
Every planar graph is 5-choosable1995-01-26Paper
Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane1994-11-29Paper
Embeddings of graphs1994-10-10Paper
Five-coloring graphs on the torus1994-09-13Paper
Five-coloring maps on surfaces1994-09-01Paper
Trees in triangulations1994-09-01Paper
Triangulating a surface with a prescribed graph1994-09-01Paper
Plane Cubic Graphs with Prescribed Face Areas1994-08-28Paper
The Even Cycle Problem for Planar Digraphs1993-12-06Paper
Highly symmetric subgraphs of hypercubes1993-10-13Paper
The Hadwiger number of infinite vertex-transitive graphs1993-03-10Paper
Isoperimetric inequalities and transient random walks on graphs1993-01-17Paper
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs1993-01-16Paper
Minimal graphs with crossing number at least \(k\)1993-01-01Paper
Vertex-transitive graphs and accessibility1993-01-01Paper
The Jordan-Schonflies Theorem and the Classification of Surface1992-09-27Paper
Transient Random Walks on Graphs and Metric Spaces with Applications to Hyperbolic Surfaces1992-09-27Paper
A Characterization of the 2-Sphere in Terms of Jordan Curve Separation1992-09-27Paper
Infinite connected graphs with no end-preserving spanning trees1992-09-27Paper
The Even Cycle Problem for Directed Graphs1992-08-13Paper
A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs1992-06-28Paper
Kings in \(k\)-partite tournaments1992-06-28Paper
Highly connected non-2-linked digraphs1992-06-27Paper
A Link Between the Jordan Curve Theorem and the Kuratowski Planarity Criterion1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39723141992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725181992-06-25Paper
Graphs with homeomorphically irreducible spanning trees1992-06-25Paper
Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface1991-01-01Paper
Bidirectional retracting-free double tracings and upper embeddability of graphs1990-01-01Paper
Embeddings of graphs with no short noncontractible cycles1990-01-01Paper
Resistances and currents in infinite electrical networks1990-01-01Paper
The converse of the Jordan curve theorem and a characterization of planar maps1989-01-01Paper
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs1989-01-01Paper
When the sign pattern of a square matrix determines uniquely the sign pattern of its inverse1989-01-01Paper
Planar acyclic oriented graphs1989-01-01Paper
The graph genus problem is NP-complete1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34916081989-01-01Paper
Infinite, highly connected digraphs with no two arc-disjoint spanning trees1989-01-01Paper
Tight bounds on the chromatic sum of a connected graph1989-01-01Paper
Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive Graphs1989-01-01Paper
Arc reversals in tournaments1988-01-01Paper
Rectilinear drawings of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38081211988-01-01Paper
On the presence of disjoint subgraphs of a specified type1988-01-01Paper
Characterization of even directed graphs1987-01-01Paper
Counterexamples to Adám's conjecture on arc reversals in directed graphs1987-01-01Paper
Hamiltonian dicycles avoiding prescribed arcs in tournaments1987-01-01Paper
On digraphs with no two disjoint directed cycles1987-01-01Paper
A characterization of locally finite vertex-transitive graphs1987-01-01Paper
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number1987-01-01Paper
Reflections on graph theory1986-01-01Paper
Sign-nonsingular matrices and even cycles in directed graphs1986-01-01Paper
Interval representations of planar graphs1986-01-01Paper
Path and cycle sub-Ramsey numbers and an edge-colouring conjecture1986-01-01Paper
Decomposition of Graphs into Chains1986-01-01Paper
Cycles through four edges in 3-connected cubic graphs1985-01-01Paper
The 2-linkage problem for acyclic digraphs1985-01-01Paper
Subgraphs with large degrees and girth1985-01-01Paper
Even cycles in directed graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917631985-01-01Paper
Gabriel andrew dirac1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935471985-01-01Paper
A refinement of Kuratowski's theorem1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166701984-01-01Paper
Subdivisions of graphs with large minimum degree1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33294721984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33374901984-01-01Paper
A theorem on paths in planar graphs1983-01-01Paper
Deformations of plane graphs1983-01-01Paper
Disjoint cycles in digraphs1983-01-01Paper
Girth in graphs1983-01-01Paper
Cycles in graphs of uncountable chromatic number1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30412121983-01-01Paper
Graph decomposition with constraints on the connectivity and minimum degree1983-01-01Paper
Graph decomposition with applications to subdivisions and path systems modulo k1983-01-01Paper
Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39689581982-01-01Paper
A nine point theorem for 3-connected graphs1982-01-01Paper
Circuits through specified edges1982-01-01Paper
Duality of infinite graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150121981-01-01Paper
A remark on the factor theorems of lovász and tutte1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39328301981-01-01Paper
Kuratowski's theorem1981-01-01Paper
Nonseparating cycles inK-Connected graphs1981-01-01Paper
Non-separating induced cycles in graphs1981-01-01Paper
The size of connected hypergraphs with prescribed covering number1981-01-01Paper
Planar cubic hypohamiltonian and hypotraceable graphs1981-01-01Paper
Long Cycles in Digraphs1981-01-01Paper
Cycles in digraphs– a survey1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090731981-01-01Paper
The cover-index of infinite graphs1980-01-01Paper
Hamiltonian-connected tournaments1980-01-01Paper
On the number of Hamiltonian cycles in tournaments1980-01-01Paper
Planarity and duality of finite and infinite graphs1980-01-01Paper
2-linked graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38759551980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38777111980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38874981980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39000871980-01-01Paper
Hypotraceable digraphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41776121979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41934891979-01-01Paper
Three‐regular subgraphs of four‐regular graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052801979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38536591979-01-01Paper
On the number of hamiltonian cycles in a maximal planar graph1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645391979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38874991979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467451978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525721978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525731978-01-01Paper
Hamiltonian Paths in Squares of Infinite Locally Finite Blocks1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41775991978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41776141978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41790451978-01-01Paper
Reconstructing 1-coherent locally finite trees1978-01-01Paper
Reconstructibility versus edge reconstructibility of infinite graphs1978-01-01Paper
On separating cycles in graphs1978-01-01Paper
Counterexamples to the Edge Reconstruction Conjecture for infinite graphs1978-01-01Paper
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41083471977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41083511977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41387521977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41433321977-01-01Paper
Straight Line Representations of Infinite Planar Graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525701977-01-01Paper
An Ore-type condition implying a digraph to be pancyclic1977-01-01Paper
Note on circuits containing specified edges1977-01-01Paper
A short proof of Meyniel's theorem1977-01-01Paper
Anticritical graphs1976-01-01Paper
Distances in orientations of graphs1976-01-01Paper
Planar and infinite hypohamiltonian and hypotraceable graphs1976-01-01Paper
Strongly self-complementary and hereditarily isomorphic tournaments1976-01-01Paper
Edge sets contained in circuits1976-01-01Paper
On pancyclic digraphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38759661976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749221975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40857441975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40537011974-01-01Paper
Graphs in which every path is contained in a Hamilton path.1974-01-01Paper
A minimal condition implying a special K\(_4\)-subdivision in a graph1974-01-01Paper
On k-rails in graphs1974-01-01Paper
Hypohamiltonian and hypotraceable graphs1974-01-01Paper
On hypohamiltonian graphs1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149541974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149551974-01-01Paper
Some Homeomorphism Properties of Graphs1974-01-01Paper
On randomly Hamiltonian graphs1973-01-01Paper
Antidirected Hamilton circuits and paths in tournaments1973-01-01Paper
Graphs in which every finite path is contained in a circuit1973-01-01Paper

Research outcomes over time

This page was built for person: Carsten Thomassen