Thomassen, Carsten
Thomassen, Carsten, 1948-....
Carsten Thomassen Danish mathematician
Carsten Thomassen
VIAF ID: 57840375 ( Personal )
Permalink: http://viaf.org/viaf/57840375
Preferred Forms
- 100 0 _ ‡a Carsten Thomassen
- 100 0 _ ‡a Carsten Thomassen ‡c Danish mathematician
-
-
-
-
-
- 100 1 _ ‡a Thomassen, Carsten ‡d 1948-
-
- 100 1 _ ‡a Thomassen, Carsten, ‡d 1948-
- 100 1 _ ‡a Thomassen, Carsten, ‡d 1948-....
4xx's: Alternate Name Forms (20)
Works
Title | Sources |
---|---|
3-connected planar spaces uniquely embed in the sphere | |
Chromatic roots and hamiltonian paths | |
Circuits through specified edges | |
Classification of locally 2-connected compact metric spaces | |
Claw-decompositions and Tutte-orientations | |
Decomposing a planer graph into an independent set and a 3-degenerate graph | |
Decomposition of graphs into chains | |
Design of large interconnection networks. | |
Edge-disjoint Hamiltonian cycles in hypertournaments | |
Every planar graph is 5-choosable | |
Existence de chemins et circuits dans les graphes | |
Girth in graphs | |
Grafteori | |
Graph decomposition with applications to subdivisions and path systems modulo k | |
Graph decomposition with constraints on the connectivity and minimum degree | |
Graph families with the Erdös-Pósa property | |
Graph theory in memory of G.A. Dirac | |
Graphs on surfaces, 2001: | |
Graphs with no path-kernels | |
Highly connected non-2-linked digraphs | |
Irreducible triangulations and triangular embeddings on a surface | |
Longs cycles dans les graphes : applications aux réseaux de Pétri | |
Lower bounds for the crossing numbers of graphs | |
Many 3-colorings of triangle-free planar graphs | |
Minimal graphs with crossing number at least k | |
On digraphs with no two disjoint directed cycles | |
On randomly Hamiltonian graphs | |
On the chromatic number of triangle-free graphs of large minimum degree | |
On the complexity of minimum cycle covers of graphs | |
On the Hadwiger-Nelson unit distance coloring problem | |
On the number of cycles in 3-connected cubic graphs | |
Parity, cycle space, and K↓4-subdivisions in graphs | |
Partial orders on a fixed graph | |
Paths, circuits and subdivisions | |
Planar acyclic oriented graphs | |
Quadrangulations and 4-color-critical graphs | |
Recent results on graph embeddings | |
Reconstructibility versus edge reconstructibility of infinite graphs | |
Rectilinear drawings of graphs | |
Sign-nonsingular matrices and even cycles in directed graphs | |
The size of connected hypergraphs with prescribed covering number | |
Some remarks on Hajós' conjecture | |
Straight line representations of infinite planar graphs | |
A theorem on paths in planar graphs | |
Thesis. | |
Totally odd K₄-subdivisions in 4-chromatic graphs | |
Transient random walks, harmonic functions, and electric currents in infinite resistive networks | |
Triangulating a surface with a prescribed graph | |
Tutte's spring theorem | |
Vulnérabilité dans les réseaux d'interconnexion | |
A ¤3-color theorem for the torus | |
The ¤converse of the Jordan Curve Theorem and a characterization of planar maps | |
The ¤Erdös-Pósa property for odd cycles in graphs of large connectivity | |
The ¤even cycle problem for planar diagraphs | |
The ¤genus problem for cubic graphs | |
The ¤graph genus problem is NP-complete | |
The ¤Hadwiger number of vertex-transitive graphs | |
An ¤intersection graph of straight lines | |
The ¤Jordan-Schönflies theorem and the classification of surfaces | |
The ¤number k-colorings of a graph on a fixed surface | |
A ¤polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs | |
A ¤refinement of Kuratowski's theorem | |
The ¤rendezvous number of a symmetric matrix and a compact connected metric space | |
A ¤short list color proof of Grötzsch's theorem | |
A ¤simpler proof of the excluded minor theorem for higher surfaces | |
The ¤zero-free intervals for chromatic polynomials of graphs |