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=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Greatest common subgraphs with specified properties
Gary Chartrand
,
Ortrud R. Oellermann
,
Farrokh Saba
,
Hung Bin Zou
Graphs and Combinatorics
5
, 1989, pp. 1-14
Hybrid triple systems and cubic feedback sets
Charles J. Colbourn
,
William R. Pulleyblank
,
Alexander Rosa
Graphs and Combinatorics
5
, 1989, pp. 15-28
On dimensional properties of graphs
Margaret Barry Cozzens
,
Fred S. Roberts
Graphs and Combinatorics
5
, 1989, pp. 29-46
Sperner families satisfying additional conditions and their convex hulls
Konrad Engel
,
Péter L. Erdös
Graphs and Combinatorics
5
, 1989, pp. 47-56
On complementary decompositions of the complete graph
Andrew Granville
,
Alexandros Moisiadis
,
Rolf Rees
Graphs and Combinatorics
5
, 1989, pp. 57-61
Characterization of
\{(q+1)+2,1;t,q\}-min \cdot hypers
and
\{2(q+1)+2,2;2,q\}-min\cdot hypers
in a finite projective geometry
Noboru Hamada
Graphs and Combinatorics
5
, 1989, pp. 63-81
Opposition graphs are strict quasi-parity graphs
C.T. Hoàng
,
F. Maffray
Graphs and Combinatorics
5
, 1989, pp. 83-85
Tight 4 and 5-designs in projective spaces
S.G. Hoggar
Graphs and Combinatorics
5
, 1989, pp. 87-94
Legitimate colorings of projective planes
N. Alon
,
Z. Füredi
Graphs and Combinatorics
5
, 1989, pp. 95-106
Large fault-tolerant interconnection networks
J.-C. Bermond
,
N. Homobono
,
C. Peyrat
Graphs and Combinatorics
5
, 1989, pp. 107-123
GBRD's: Some new constructions for difference matrices, generalised Hadamard matrices and balanced generalised weighing matrices
Warwick de Launey
Graphs and Combinatorics
5
, 1989, pp. 125-135
Characterization of
\{v_{\mu+1}+2v_\mu,v_\mu+2v_{\mu-1};t,q\}-min\cdot hypers
and its applications to error-correcting codes
Noboru Hamada
Graphs and Combinatorics
5
, 1989, pp. 137-147
Slim Graphs
A. Hertz
Graphs and Combinatorics
5
, 1989, pp. 149-157
A generalization of the Katona theorem for cross
t
-intersecting families
Makoto Matsumoto
,
Norihide Tokushige
Graphs and Combinatorics
5
, 1989, pp. 159-171
On the factor-thickness of regular graphs
Y.H. Peng
,
C.C. Chen
,
K.M. Koh
Graphs and Combinatorics
5
, 1989, pp. 173-188
Some extensions of a hypergraph
Sze-Chin Shee
Graphs and Combinatorics
5
, 1989, pp. 189-196
A partition identity on binomial coefficients and its applications
Wenchang Chu
Graphs and Combinatorics
5
, 1989, pp. 197-200
On a connection between the existence of
k
-trees and the toughness of a graph
Sein Win
Graphs and Combinatorics
5
, 1989, pp. 201-205
Paths and cycles in matroid base graphs
Brian Alspach
,
Guizhen Liu
Graphs and Combinatorics
5
, 1989, pp. 207-211
Near 2-factorizations of
2K_n
: Cycles of even length
James Burling
,
Katherine Heinrich
Graphs and Combinatorics
5
, 1989, pp. 213-221
Distance degrees of vertex-transitive graphs
Teluhiko Hilano
Graphs and Combinatorics
5
, 1989, pp. 223-228
On spectra of doubly regular asymmetric digraphs of
RH
-type
Noboru Ito
Graphs and Combinatorics
5
, 1989, pp. 229-234
New Hadamard matrix of order 24
Hiroshi Kimura
Graphs and Combinatorics
5
, 1989, pp. 235-242
A perfect one-factorization of
K_36
Midori Kobayashi
,
Hitoshi Awoki
,
Yoshimi Nakazaki
,
Gisaku Nakamura
Graphs and Combinatorics
5
, 1989, pp. 243-244
Linking
(n-2)
-dimensional panels in
n
-space II:
(n-2,2)
-frameworks and body and hinge structures
Tiong-Seng Tay
Graphs and Combinatorics
5
, 1989, pp. 245-273
Seiten 1
2
>