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: Journal=J. Graph Theory AND YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
k
-leaf connectivity of a random graph
Tomasz Łuczak
Journal of Graph Theory
12
(1), 1988, pp. 1-10
Contractions and Hamiltonian line graphs
Hong-Jian Lai
Journal of Graph Theory
12
(1), 1988, pp. 11-15
Graphs with unavoidable subgraphs with large degrees
L. Caccetta
,
Paul Erdŏs
,
K. Vijayan
Journal of Graph Theory
12
(1), 1988, pp. 17-27
A reduction method to find spanning Eulerian subgraphs
Paul A. Catlin
Journal of Graph Theory
12
(1), 1988, pp. 29-44
Searching for an edge in a graph
M. Aigner
,
E. Triesch
Journal of Graph Theory
12
(1), 1988, pp. 45-57
Search algorithm for Ramsey graphs by union of group orbits
Stanisƚaw P. Radziszowski
,
Donald L. Kreher
Journal of Graph Theory
12
(1), 1988, pp. 59-72
Homomorphisms of graphs into odd cycles
A.M.H. Gerards
Journal of Graph Theory
12
(1), 1988, pp. 73-83
Hamiltonian properties of the cube of a 2-edge connected graph
M. Paoli
Journal of Graph Theory
12
(1), 1988, pp. 85-94
A lower bound on the number spanning trees with
k
end-vertices
Katherine Heinrich
,
Guizhen Liu
Journal of Graph Theory
12
(1), 1988, pp. 95-100
On the presence of disjoint subgraphs of a specified type
Carsten Thomassen
Journal of Graph Theory
12
(1), 1988, pp. 101-111
Generalized Hamiltonian circuits in the Cartesian product of two-directed cycles
Douglas S. Jungreis
Journal of Graph Theory
12
(1), 1988, pp. 113-120
Cutting a graph into two dissimilar halves
Paul Erdŏs
,
Mark Goldberg
,
János Pach
,
Joel Spencer
Journal of Graph Theory
12
(1), 1988, pp. 121-131
An historical note: Euler's Königsberg letters
Horst Sachs
,
Michael Stiebitz
,
Robin J. Wilson
Journal of Graph Theory
12
(1), 1988, pp. 133-139
A sufficient condition for a bipartite graph to have a
k
-factor
Hikoe Enomoto
,
Katsuhiro Ota
,
Mikio Kano
Journal of Graph Theory
12
(1), 1988, pp. 141-151
Exotic
n
-universal graphs
T.D. Parsons
,
Tomaz̑ Pisanski
Journal of Graph Theory
12
(2), 1988, pp. 155-158
Pursuit-evasion games on graphs
F.R.K. Chung
,
Joel E. Cohen
,
R.L. Graham
Journal of Graph Theory
12
(2), 1988, pp. 159-167
On the strong perfect graph conjecture
Stephen Olariu
Journal of Graph Theory
12
(2), 1988, pp. 169-176
Chromatic factorizations of a graph
S. Louis Hakimi
,
Edward F. Schmeichel
Journal of Graph Theory
12
(2), 1988, pp. 177-182
Nowhere-zero flows in low genus graphs
Martina Möller
,
Hans Georg Carstens
,
Gunnar Brinkmann
Journal of Graph Theory
12
(2), 1988, pp. 183-190
On the number of Hamiltonian cycles in triangulations
Jan Kratochvíl
,
Dainis Zeps
Journal of Graph Theory
12
(2), 1988, pp. 191-194
Transforming trees by successive local complementations
André Bouchet
Journal of Graph Theory
12
(2), 1988, pp. 195-207
Hamilton cycles in claw-free graphs
Cun-Quan Zhang
Journal of Graph Theory
12
(2), 1988, pp. 209-216
On-line and first fit colorings of graphs
A. Gyárfás
,
J. Lehel
Journal of Graph Theory
12
(2), 1988, pp. 217-227
The average distance and the independence number
F.R.K. Chung
Journal of Graph Theory
12
(2), 1988, pp. 229-235
The reconstruction conjecture is true if all 2-connected graphs are reconstructible
Yang Yongzhi
Journal of Graph Theory
12
(2), 1988, pp. 237-243
Seiten 1
2
3
>