Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Thomassen, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chromatic roots and Hamiltonian paths
C. Thomassen
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 218-224
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
N. Alon
,
D. Kleitman
,
C. Thomassen
,
M. Saks
,
P. Seymour
Journal of Graph Theory
11
(3), 1987, pp. 367-371
On digraphs with no two disjoint directed cycles
C. Thomassen
Combinatorica
7
(1), 1987, pp. 145-150
Cycles through four edges in 3-connected cubic graphs
R.E.L. Aldred
,
D.A. Holton
,
C. Thomassen
Graphs and Combinatorics
1
, 1985, pp. 7-
A nine point theorem for 3-connected graphs
D.A. Holton
,
B.D. McKay
,
M.D. Plummer
,
C. Thomassen
Combinatorica
2
, 1982, pp. 53-62
Cycles in digraphs - A survey
J.C. Bermond
,
C. Thomassen
Journal of Graph Theory
5
(1), 1981, pp. 1-43
Three-regular subgraphs of four-regular graphs
V. Chvátal
,
H. Fleischner
,
J. Sheehan
,
C. Thomassen
Journal of Graph Theory
3
(4), 1979, pp. 371-386
On the number of Hamiltonian cycles in a maximal planar graph
S.L. Hakimi
,
E.F. Schmeichel
,
C. Thomassen
Journal of Graph Theory
3
(4), 1979, pp. 365-370
Distances in orientations of graphs
V. Chvátal
,
C. Thomassen
Journal of Combinatorial Theory Series B
24
(1), 1978, February, pp. 61-75