results  search [or]  (ISNI Number (ISN:))   1 hits 
ISNI: 
0000 0001 0976 1816 
Name: 
Thomassen, C.
Thomassen, Carsten

Dates: 
1948 
Creation class: 
a
Language material
Manuscript language material

Related names: 
Aarhus Universitet
Andersen, Lars Døvling (1950 ))
Bollobás, Béla
Carleton University. Department of Mathematics and Statistics
Gao, ZhiCheng
Mohar, Bojan
Richmond, L. B.
Richmond, Lawrence Bruce
Richter, Bruce (1957)
Richter, R. Bruce
University of Waterloo. Department of Combinatorics and Optimization
University of Waterloo. Faculty of Mathematics

Titles: 
¤chromatic number of a graph of girth 5 on a fixed surface, The
¤color space of a graph, The
¤ErdösPósa property for odd cycles in graphs of large connectivity, The
¤intersection graph of straight lines, An
¤locally connected compact metric spaces embeddable in the plane, The
¤number kcolorings of a graph on a fixed surface, The
¤short list color proof of Grötzsch's theorem, A
2listcoloring planar graphs without monochromatic triangles
3connected planar spaces uniquely embed in the sphere
Applications of Tutte cycles
Chromatic roots and hamiltonian paths
Classification of locally 2connected compact metric spaces
Clawdecompositions and Tutteorientations
Counterexamples to Faudree and Schelp's conjecture on Hamiltonian connected graphs
coverindex of infinite graphs, The
Decomposing a planer graph into an independent set and a 3degenerate graph
Edgedisjoint Hamiltonian cycles in hypertournaments
Exponentially many 5listcolorings of planar graphs
Graphs on surfaces, 2001:
Graphs with no pathkernels
Hamiltonian connected tournaments
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
Long cycles in graphs on a fixed surface
Many 3colorings of trianglefree planar graphs
Minimal graphs with crossing number at least k
Nonseparating cycles in kconnected graphs
On the chromatic number of pentagonfree graphs of large minimum degree
On the chromatic number of trianglefree graphs of large minimum degree
On the number of Hamiltonian cycles in tournaments
Parity, cycle space, and K↓4subdivisions in graphs
Paths and cycles in graphs
Planar cubic hypohamiltonian and hypotraceable graphs
Planarity and duality of finite and infinite graphs
Quadrangulations and 4colorcritical graphs
Reconstructibility versus edge reconstructibility of infinite graphs
Reconstructing 1coherent 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

Notes: 

Sources: 