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 Volume=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge-connectivity in
p
-partite graphs
Lutz Volkmann
Journal of Graph Theory
13
(1), 1989, pp. 1-6
The Ramsey number of
K_5-e
C. Clapham
,
G. Exoo
,
H. Harborth
,
I. Mengersen
,
J. Sheehan
Journal of Graph Theory
13
(1), 1989, pp. 7-15
Longest cycles in 3-connected graphs contain three contractible edges
Nathaniel Dean
,
Robert L. Hemminger
,
Katsuhiro Ota
Journal of Graph Theory
13
(1), 1989, pp. 17-21
Critically cochromatic graphs
Izak Broere
,
Marieta Burger
Journal of Graph Theory
13
(1), 1989, pp. 23-28
Graphs without four-cycles
C.R.J. Clapham
,
A. Flockhart
,
J. Sheehan
Journal of Graph Theory
13
(1), 1989, pp. 29-47
On the genus of the semidirect product of
Z_9
by
Z_3
Matthew G. Brin
,
David E. Rauschenberg
,
Craig C. Squier
Journal of Graph Theory
13
(1), 1989, pp. 49-61
Independence number, connectivity, and
r
-factors
Tsuyoshi Nishimura
Journal of Graph Theory
13
(1), 1989, pp. 63-69
Infinite, highly connected digraphs with no two arc-disjoint spanning trees
Ron Aharoni
,
Carsten Thomassen
Journal of Graph Theory
13
(1), 1989, pp. 71-74
Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs
Leif Kjær Jrgensen
Journal of Graph Theory
13
(1), 1989, pp. 75-85
A note on list-colorings
Amanda Chetwynd
,
Roland Häggkvist
Journal of Graph Theory
13
(1), 1989, pp. 87-95
A lower bound for
R(5,5)
Geoffrey Exoo
Journal of Graph Theory
13
(1), 1989, pp. 97-98
Graph spanners
David Peleg
,
Alejandro A. Schäffer
Journal of Graph Theory
13
(1), 1989, pp. 99-116
Is every cycle basis fundamental?
David Hartvigsen
,
Eitan Zemel
Journal of Graph Theory
13
(1), 1989, pp. 117-137
On the delta-wye reduction for planar graphs
K. Truemper
Journal of Graph Theory
13
(2), 1989, pp. 141-148
Circumference of a regular graph
Min Aung
Journal of Graph Theory
13
(2), 1989, pp. 149-155
Paths in bipartite graphs with color-inverting involutions
Gert Sabidussi
Journal of Graph Theory
13
(2), 1989, pp. 157-174
Three tree-paths
Avram Zehavi
,
Alon Itai
Journal of Graph Theory
13
(2), 1989, pp. 175-188
Interval digraphs: An analogue of interval graphs
M. Sen
,
S. Das
,
A.B. Roy
,
D.B. West
Journal of Graph Theory
13
(2), 1989, pp. 189-202
On the greatest number of 2 and 3 colorings of a
(V,E)
-graph
Felix Lazebnik
Journal of Graph Theory
13
(2), 1989, pp. 203-214
Graphs with intrinsic
S_3
convexities
Hans-Jürgen Bandelt
Journal of Graph Theory
13
(2), 1989, pp. 215-228
Locally 4-by-4 grid graphs
A. Blokhuis
,
A.E. Brouwer
Journal of Graph Theory
13
(2), 1989, pp. 229-244
Ramsey numbers for graphs with five vertices
George R.T. Hendry
Journal of Graph Theory
13
(2), 1989, pp. 245-248
Common root functions of two digraphs
Cai Mao-cheng
Journal of Graph Theory
13
(2), 1989, pp. 249-256
A strengthening of Kikust's theorem
George R.T. Hendry
Journal of Graph Theory
13
(2), 1989, pp. 257-260
Maximal Antiramsey graphs and the strong chromatic number
S.A. Burr
,
P. Erdŏs
,
R.L. Graham
,
V.T. Sós
Journal of Graph Theory
13
(3), 1989, pp. 263-282
Seiten 1
2
3
>