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=Discrete Math. AND Volume=120
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Wreath products and enlargements of groups
Shreeram S. Abhyankar
Discrete Mathematics
120
(1-3), 1993, pp. 1-12
On Greene-Kleitman's theorem for general digraphs
Ron Aharoni
,
Irith Ben-Arroyo Hartman
Discrete Mathematics
120
(1-3), 1993, pp. 13-24
One-factors and the existence of affine designs
Neal Brand
,
Somporn Sutinuntopas
Discrete Mathematics
120
(1-3), 1993, pp. 25-35
Chains, multichains and Möbius numbers
J.W. Breckenridge
,
K. Varadarajan
,
K.H. Wehrhahn
Discrete Mathematics
120
(1-3), 1993, pp. 37-50
Construction of new symmetric designs with parameters (70, 24, 8)
Anka Golemac
Discrete Mathematics
120
(1-3), 1993, pp. 51-58
Planar graphs with no 6-wheel minor
Bradley S. Gubser
Discrete Mathematics
120
(1-3), 1993, pp. 59-73
Maximal partial spreads and the modular
n
-queen problem
Olof Heden
Discrete Mathematics
120
(1-3), 1993, pp. 75-91
Bounds relating generalized domination parameters
Michael A. Henning
,
Henda C. Swart
Discrete Mathematics
120
(1-3), 1993, pp. 93-105
The coordinate representation of a graph and
n
-universal graph of radius 1
A.V. Ivashchenko
Discrete Mathematics
120
(1-3), 1993, pp. 107-114
A construction for Hadamard matrices
H. Kharaghani
Discrete Mathematics
120
(1-3), 1993, pp. 115-120
On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices
Yaakov S. Kupitz
Discrete Mathematics
120
(1-3), 1993, pp. 121-134
Existence results for doubly near resolvable
(v, 3, 2)
-BIBDs
E.R. Lamken
,
S.A. Vanstone
Discrete Mathematics
120
(1-3), 1993, pp. 135-148
How to select a loser
Helmut Prodinger
Discrete Mathematics
120
(1-3), 1993, pp. 149-159
Menger-type theorems with restrictions on path lengths
Lásló Pyber
,
Zsolt Tuza
Discrete Mathematics
120
(1-3), 1993, pp. 161-174
A combinatorial decomposition of acyclic simplical complexes
Richard P. Stanley
Discrete Mathematics
120
(1-3), 1993, pp. 175-182
On locally
k
-critically
n
-connected graphs
Jianji Su
Discrete Mathematics
120
(1-3), 1993, pp. 183-190
On the partition and coloring of a graph by cliques
W.D. Wallis
,
Guo-Hui Zhang
Discrete Mathematics
120
(1-3), 1993, pp. 191-203
Matchings and the sum function
C. Kenneth Fan
Discrete Mathematics
120
(1-3), 1993, pp. 205-209
A characterization of intersection graphs of the maximal rectangles of a polyomino
Frédéric Maire
Discrete Mathematics
120
(1-3), 1993, pp. 211-214
List colourings of planar graphs
Margit Voigt
Discrete Mathematics
120
(1-3), 1993, pp. 215-219
On the harmoniousness of dicyclic groups
Cheng-De Wang
Discrete Mathematics
120
(1-3), 1993, pp. 221-225
The mean chromatic number of paths and cycles
Martin Anthony
,
Norman Biggs
Discrete Mathematics
120
(1-3), 1993, pp. 227-231
A constructing method of a class of SIDS
(n)
Xiaomin Bao
Discrete Mathematics
120
(1-3), 1993, pp. 233-239
A new infinite series of regular uniformly geodetic code graphs
A.E. Brouwer
,
J.H. Koolen
Discrete Mathematics
120
(1-3), 1993, pp. 241-247
A three-class association scheme on the flags of a finite projective plane and a (PBIB) design defined by the incidence of the flags and the Baer subplanes in PG
(2, q^2)
I.M. Chakravarti
Discrete Mathematics
120
(1-3), 1993, pp. 249-252
Seiten 1
2
>