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=Graphs and Combinatorics AND Volume=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ramsey numbers for local colorings
A. Gyárfás
,
J. Lehel
,
R.H. Schelp
,
ZS. Tuza
Graphs and Combinatorics
3
, 1987, pp. 267-277
On the problem of bandsize
Katherine Heinrich
,
Pavol Hell
Graphs and Combinatorics
3
, 1987, pp. 279-284
On the
l
-connectivity of a graph
Ortrud R. Oellermann
Graphs and Combinatorics
3
, 1987, pp. 285-291
The classification of finite connected hypermetric spaces
Paul Terwilliger
,
Michel Deza
Graphs and Combinatorics
3
, 1987, pp. 293-298
Cycles through five edges in 3-connected cubic graphs
R.E.L. Aldred
,
D.A. Holton
Graphs and Combinatorics
3
, 1987, pp. 299-311
Mendelsohn designs admitting the affine group
Neal Brand
,
W. Cary Huffman
Graphs and Combinatorics
3
, 1987, pp. 313-324
Enumeration of parallelogram polyominoes with given bond and site perimeter
M.P. Delest
,
D. Gouyou-Beauchamps
,
B. Vauquelin
Graphs and Combinatorics
3
, 1987, pp. 325-339
Bounding one-way differences
P. Frankl
,
Z. Füredi
,
J. Pach
Graphs and Combinatorics
3
, 1987, pp. 341-347
The splitting number of the complete graph in the projective plane
Nora Hartsfield
Graphs and Combinatorics
3
, 1987, pp. 349-356
Line domination in graphs
S.R. Jayaram
Graphs and Combinatorics
3
, 1987, pp. 357-363
Pairwise balanced designs with block sizes
6t + 1
R.C. Mullin
,
D.R. Stinson
Graphs and Combinatorics
3
, 1987, pp. 365-377
Elementary strong maps of graphic matroids
András Recski
Graphs and Combinatorics
3
, 1987, pp. 379-382
Underlying graph and total length of optimal realizatins of variable distance matrices
J.M.S. Simões-Pereira
Graphs and Combinatorics
3
, 1987, pp. 383-393
Seiten
<
1
2