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 YEAR=1973
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Arrays with fixed row and column sums
Morton Abramson
,
W.O.J. Moser
Discrete Mathematics
6
, 1973, pp. 1-14
Combinatorial problems on the existence of large submatrices I
H. Burkill
,
L. Mirsky
Discrete Mathematics
6
, 1973, pp. 15-28
The asymptotic number of (0,1)-matrices with zero permanent
C.J. Everett
,
P.R. Stein
Discrete Mathematics
6
, 1973, pp. 29-34
Theory of path length distributions I
R.J. Faudree
,
C.C. Rousseau
,
R.H. Schelp
Discrete Mathematics
6
, 1973, pp. 35-52
The least number of edges for graphs having dihedral automorphism group
Gary Haggard
Discrete Mathematics
6
, 1973, pp. 53-78
Algorithms for constructing graphs and digraphs with given valences and factors
D.J. Kleitman
,
D.L. Wang
Discrete Mathematics
6
, 1973, pp. 79-88
Extending a functions on a graph
D.F. Robinson
Discrete Mathematics
6
, 1973, pp. 89-99
On the group and the circuit group of a graph
Steve Gallant
Discrete Mathematics
6
, 1973, pp. 101-103
Expansions of the chromatic polynomial
Norman Biggs
Discrete Mathematics
6
, 1973, pp. 105-113
Parity of paths and circuits in tournaments
Rodney Forcade
Discrete Mathematics
6
, 1973, pp. 115-118
Linear programs dependent on a single parameter
R.G. Jeroslow
Discrete Mathematics
6
, 1973, pp. 119-140
On the average size of the sets in a Sperner family
D.J. Kleitman
,
E.C. Milner
Discrete Mathematics
6
, 1973, pp. 141-147
On the construction of cyclic quasigroups
Charles C. Lindner
Discrete Mathematics
6
, 1973, pp. 149-158
The Ramsey numbers
r(P_m, K_n)
T.D. Parsons
Discrete Mathematics
6
, 1973, pp. 159-162
The enumeration of Hamiltonian polygons in rooted planar triangulations
P.N. Rathie
Discrete Mathematics
6
, 1973, pp. 163-168
Graphs of given genus and arbitrarily large maximum genus
Richard D. Ringeisen
Discrete Mathematics
6
, 1973, pp. 169-174
A decomposition algorithm for optimality problems in tree-structured networks
D.R. Shier
Discrete Mathematics
6
, 1973, pp. 175-189
Replication results for certain combinatorial configurations
W.G. Bridges
Discrete Mathematics
6
, 1973, pp. 191-199
The lattice of integer partitions
Thomas Brylawski
Discrete Mathematics
6
, 1973, pp. 201-219
Convexity cuts for multiple choice problems
Fred Glover
Discrete Mathematics
6
, 1973, pp. 221-234
Characterization of unary developmental languages
G.T. Herman
,
K.P. Lee
,
J. van Leeuwen
,
G. Rozenberg
Discrete Mathematics
6
, 1973, pp. 235-247
Analogues of Eberhard's theorem for 4-valent 3-polytopes with involutory automorphisms
Ernest Jucovic̑
Discrete Mathematics
6
, 1973, pp. 249-254
Families of
k
-independent sets
Daniel J. Kleitman
,
Joel Spencer
Discrete Mathematics
6
, 1973, pp. 255-262
Equivalence of
n
-tournaments via
k
-path reversals
K.B. Reid
Discrete Mathematics
6
, 1973, pp. 263-280
Graphs indecomposable with respect to the
X
-join
David P. Sumner
Discrete Mathematics
6
, 1973, pp. 281-298
Seiten 1
2
3
4
5
>