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
[2]
Hilfe
Suche: Journal=Graphs and Combinatorics AND Volume=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting some finite-fold coverings of a graph
Jin Ho Kwak
,
Jaeun Lee
Graphs and Combinatorics
8
, 1992, pp. 277-285
On families of faces in discrete cubes
Roy Meshulam
Graphs and Combinatorics
8
, 1992, pp. 287-289
Shannon switching games without terminals III
Yōhei Yamasaki
Graphs and Combinatorics
8
, 1992, pp. 291-297
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
F. Franek
,
V. Rödl
Graphs and Combinatorics
8
, 1992, pp. 299-308
The uniformity lemma for hypergraphs
P. Frankl
,
V. Rödl
Graphs and Combinatorics
8
, 1992, pp. 309-312
A note on the arboricity of graphs
Martin Kochol
Graphs and Combinatorics
8
, 1992, pp. 313-315
Circulant
GH(p^2;Z_p)
exist for all primes
p
Warwick de Launey
Graphs and Combinatorics
8
, 1992, pp. 317-321
Monochromatic vs multicolored paths
Hanno Lefmann
,
Vojtȇch Rödl
,
Robin Thomas
Graphs and Combinatorics
8
, 1992, pp. 323-332
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Zbigniew Lonc
Graphs and Combinatorics
8
, 1992, pp. 333-341
Minimal asymmetric graphs of induced length 4
Jaroslav Nes̑etȓil
,
Gert Sabidussi
Graphs and Combinatorics
8
, 1992, pp. 343-359
Peripheral and eccentric vertices in graphs
K.B. Reid
,
Weizhen Gu
Graphs and Combinatorics
8
, 1992, pp. 361-375
A generalization of Menger's theorem for certain unicyclic graphs
E. Sampathkumar
Graphs and Combinatorics
8
, 1992, pp. 377-380
2-designs over
GF(q)
Hiroshi Suzuki
Graphs and Combinatorics
8
, 1992, pp. 381-389
Research problems - Sets of vectors with many orthogonal pairs
Zoltán Füredi
,
Richard Stanley
Graphs and Combinatorics
8
, 1992, pp. 391-394
Seiten
<
1
2