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 YEAR=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On component factors
Yoshimi Egawa
,
Hikoe Enomoto
,
Akira Saito
Graphs and Combinatorics
2
, 1986, pp. 223-225
Induced trees in sparse random graphs
W. Fernandez de la Vega
Graphs and Combinatorics
2
, 1986, pp. 227-231
Characterization of partial 3-trees in terms of three structures
Yoji Kajitani
,
Akio Ishizuka
,
Shuichi Ueno
Graphs and Combinatorics
2
, 1986, pp. 233-246
Construction of Hadamard matrices of order 28
Hiroshi Kimura
,
Hiroyuki Ohmori
Graphs and Combinatorics
2
, 1986, pp. 247-257
An analogue of
t
-designs in the association schemes of alternating bilinear forms
Akihiro Munemasa
Graphs and Combinatorics
2
, 1986, pp. 259-267
On sets of integers with the Schur property
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Graphs and Combinatorics
2
, 1986, pp. 269-275
On orthogonal arrays of strength 3 and 5 - Achieving Rao's bound
Ryuzaburo Noda
Graphs and Combinatorics
2
, 1986, pp. 277-282
t
-designs in classical association schemes
Dennis Stanton
Graphs and Combinatorics
2
, 1986, pp. 283-286
Current research on algebraic combinatorics - Supplements to our book, Algebraic Combinatorics I
Eiichi Bannai
,
Tatsuro Ito
Graphs and Combinatorics
2
, 1986, pp. 287-308
An Erd\Hos-Ko-Rado theorem for regular intersecting families of octads
A.E. Brouwer
,
A.R. Calderbank
Graphs and Combinatorics
2
, 1986, pp. 309-316
Quadratic leaves of maximal partial triple systems
Charles J. Colbourn
,
Alexander Rosa
Graphs and Combinatorics
2
, 1986, pp. 317-337
Colouring finite incidence structures
J. Csima
,
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 339-346
On a construction of Thomassen
Peter Horák
,
Jozef S̑irán̑
Graphs and Combinatorics
2
, 1986, pp. 347-350
Generalized van der Waerden numbers
Bruce M. Landman
Graphs and Combinatorics
2
, 1986, pp. 351-356
Finite union theorem with restrictions
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Graphs and Combinatorics
2
, 1986, pp. 357-361
Quick gossiping without duplicate transmissions
Ákos Seress
Graphs and Combinatorics
2
, 1986, pp. 363-381
Seiten
<
1
2