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 YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Removable edges in cyclically 4-edge-connected cubic graphs
Lars Dvling Andersen
,
Herbert Fleischner
,
Bill Jackson
Graphs and Combinatorics
4
, 1988, pp. 1-21
On the Euclidean dimension of a wheel
Fred Buckley
,
Frank Harary
Graphs and Combinatorics
4
, 1988, pp. 23-30
Rigid pentagons in hypercubes
M. Deza
,
N.M. Singhi
Graphs and Combinatorics
4
, 1988, pp. 31-42
Embedding of trees in Euclidean spaces
H. Maehara
,
J. Reiterman
,
V. Rödl
,
E. S̑in̑ajová
Graphs and Combinatorics
4
, 1988, pp. 43-47
Survival under random coverings of trees
A. Meir
,
J.W. Moon
Graphs and Combinatorics
4
, 1988, pp. 49-65
Divisions of symmetric designs into two parts
Alan Rahilly
Graphs and Combinatorics
4
, 1988, pp. 67-73
On natural isomorphisms of cycle permutation graphs
Sam Stueckle
Graphs and Combinatorics
4
, 1988, pp. 75-85
Balanced sets and
Q
-polynomial association schemes
Paul Terwilliger
Graphs and Combinatorics
4
, 1988, pp. 87-94
Stronger players win more balanced knockout tournaments
Robert Chen
,
F.K. Hwang
Graphs and Combinatorics
4
, 1988, pp. 95-99
On the independent queens covering problem
E.J. Cockayne
,
P.H. Spencer
Graphs and Combinatorics
4
, 1988, pp. 101-110
C_k
-factorization of complete bipartite graphs
H. Enomoto
,
T. Miyamoto
,
K. Ushio
Graphs and Combinatorics
4
, 1988, pp. 111-113
Matchings and covers in hypergraphs
Zoltán Füredi
Graphs and Combinatorics
4
, 1988, pp. 115-206
Repeated distances in space
David Avis
,
Paul Erdŏs
,
János Pach
Graphs and Combinatorics
4
, 1988, pp. 207-217
On distance-regular graphs with fixed valency, II
Eiichi Bannai
,
Tatsuro Ito
Graphs and Combinatorics
4
, 1988, pp. 219-228
The chromatic connectivity of graphs
C.D. Godsil
,
R. Nowakowski
,
J. Nes̑etȓil
Graphs and Combinatorics
4
, 1988, pp. 229-233
The line digraph of a regular and pancircular digraph is also regular and pancircular
Masatosi Imori
,
Makoto Matsumoto
,
Hisao Yamada
Graphs and Combinatorics
4
, 1988, pp. 235-239
Orthogonal resolutions in odd balanced tournament designs
E.R. Lamken
,
S.A. Vanstone
Graphs and Combinatorics
4
, 1988, pp. 241-255
Structural theorems for submodular functions, polymatroids and polymatroid intersections
Masataka Nakamura
Graphs and Combinatorics
4
, 1988, pp. 257-284
Irregular, extremal perfect systems of difference sets II
D.G. Rogers
Graphs and Combinatorics
4
, 1988, pp. 285-295
On a series of Hadamard matrices of order
2^t
and the maximal excess of Hadamard matrices of order
2^{2t}
Mieko Yamada
Graphs and Combinatorics
4
, 1988, pp. 297-301
Every 8-uniform 8-regular hypergraph is 2-colorable
N. Alon
,
Z. Bregman
Graphs and Combinatorics
4
, 1988, pp. 303-305
Algorithmic aspects of intersection graphs and representation hypergraphs
Martin Charles Golumbic
Graphs and Combinatorics
4
, 1988, pp. 307-321
Combinatorial geometries representable over
GF(3)
and
GF(q)
- II. Dowling geometries
Joseph P.S. Kung
,
James G. Oxley
Graphs and Combinatorics
4
, 1988, pp. 323-332
The number of contractible edges in 3-connected graphs
Katsuhiro Ota
Graphs and Combinatorics
4
, 1988, pp. 333-354
New Hadamard matrices and conference matrices obtained via Mathon's construction
Jennifer Seberry
,
Albert Leon Whiteman
Graphs and Combinatorics
4
, 1988, pp. 355-377
Seiten 1
2
>