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="Hendry, George R.T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An extremal problem for cycles in Hamiltonian graphs
George R.T. Hendry
,
Stephan Brandt
Graphs and Combinatorics
11
, 1995, pp. 255-262
Extending cycles in bipartite graphs
George R.T. Hendry
Journal of Combinatorial Theory Series B
51
, 1991, pp. 292-313
Ramsey numbers for graphs with five vertices
George R.T. Hendry
Journal of Graph Theory
13
(2), 1989, pp. 245-248
A strengthening of Kikust's theorem
George R.T. Hendry
Journal of Graph Theory
13
(2), 1989, pp. 257-260
Extending cycles in directed graphs
George R.T. Hendry
Journal of Combinatorial Theory Series B
46
, 1989, pp. 162-172
On minimum degree in Hamiltonian path graphs
George R.T. Hendry
Journal of Graph Theory
12
(4), 1988, pp. 491-497
On the Hamiltonian path graph of a graph
George R.T. Hendry
Journal of Graph Theory
11
(3), 1987, pp. 373-384
Maximum non-path-connected graphs
George R.T. Hendry
Journal of Combinatorial Theory Series B
37
, 1984, pp. 294-298