sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000109761816 | 1 hits
Person
ISNI: 
0000 0001 0976 1816
Name: 
Carsten Thomassen
Carsten Thomassen (dänischer Mathematiker)
Carsten Thomassen (Danish mathematician)
Carsten Thomassen (dansk matematiker)
Carsten Thomassen (wiskundige uit Denemarken)
Thomassen, C.
Thomassen, Carsten
Dates: 
1948-
Creation class: 
a
Language material
Manuscript language material
Creation role: 
author
Related names: 
Aarhus Universitet
Bermond, Jean-Claude (1945-....))
Bollobás, Béla (1943- ))
Carleton University. Department of Mathematics and Statistics
Gao, Zhi-Cheng
Mohar, Bojan
Richter, Bruce (1957-)
Richter, R. Bruce
Toft, Bjarne
University of Waterloo
University of Waterloo. Department of Combinatorics and Optimization
University of Waterloo. Faculty of Mathematics
Titles: 
¤Erdös-Pósa property for odd cycles in graphs of large connectivity, The
¤intersection graph of straight lines, An
¤number k-colorings of a graph on a fixed surface, The
¤short list color proof of Grötzsch's theorem, A
3-connected planar spaces uniquely embed in the sphere
Chromatic roots and hamiltonian paths
Classification of locally 2-connected compact metric spaces
Claw-decompositions and Tutte-orientations
Counterexamples to Faudree and Schelp's conjecture on Hamiltonian connected graphs
cover-index of infinite graphs, The
Decomposing a planer graph into an independent set and a 3-degenerate graph
Design of large interconnection networks.
Graph theory in memory of G.A. Dirac
Graphs on surfaces
Graphs with no path-kernels
Hamiltonian paths in squares of infinite locally finite blocks
Irreducible triangulations and triangular embeddings on a surface
Long cycles in digraphs with constrains on the degrees
Longs cycles dans les graphes applications aux réseaux de Pétri
Many 3-colorings of triangle-free planar graphs
Minimal graphs with crossing number at least k
Non-separating cycles in k-connected graphs
On the chromatic number of triangle-free graphs of large minimum degree
On the number of Hamiltonian cycles in tournaments
Parity, cycle space, and K↓4-subdivisions in graphs
Paths and cycles in graphs
Planar cubic hypohamiltonian and hypotraceable graphs
Quadrangulations and 4-color-critical graphs
Reconstructing 1-coherent locally finite trees
size of connected hypergraphs with prescribed covering number, The
Some remarks on Hajós' conjecture
Straight line representations of infinite planar graphs
Thesis.
Tutte's spring theorem
Vulnérabilité dans les réseaux d'interconnexion
Notes: 
Thesis (Ph. D.)--University of Waterloo, 1976
Sources: 
VIAF DBC LAC LC NUKAT SUDOC WKD