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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On some extremal problems on
r
-graphs
P. Erdŏs
Discrete Mathematics
1
(1), 1971, pp. 1-6
The cutting center theorem for trees
Frank Harary
,
Phillip A. Ostrand
Discrete Mathematics
1
(1), 1971, pp. 7-18
Some positive definite functions on sets and their application to the Ising model
Ole J. Heilmann
,
Daniel J. Kleitmann
,
Elliott H. Lieb
,
Seymour Sherman
Discrete Mathematics
1
(1), 1971, pp. 19-27
Transformation of integer programs to knapsack problems
Gordon H. Bradley
Discrete Mathematics
1
(1), 1971, pp. 29-45
Maximal sized antichains in partial orders
D. Kleitman
,
M. Edelberg
,
D. Lubell
Discrete Mathematics
1
(1), 1971, pp. 47-53
The asymptotic number of integer stochastic matrices
C.J. Everett
,
P.R. Stein
Discrete Mathematics
1
(1), 1971, pp. 55-72
Left-right double trees
Ladislav Nebeský
Discrete Mathematics
1
(1), 1971, pp. 73-81
Graph theory and statistical physics
John W. Essam
Discrete Mathematics
1
(1), 1971, pp. 83-112
Algebraic structure of chromatic graphs associated with the Ramsey number
N(3,3,3;2)
Earl Glen, Jr. Whitehead
Discrete Mathematics
1
(1), 1971, pp. 113-114
A generalized
q
-binomial Vandermonde convolution
Edward A. Bender
Discrete Mathematics
1
(2), 1971, pp. 115-119
Large cycles in graphs
J.A. Bondy
Discrete Mathematics
1
(2), 1971, pp. 121-132
On the
k
-index of graphs
Juraj Bosák
Discrete Mathematics
1
(2), 1971, pp. 133-146
Sur l'epaisseur des graphes réguliers
M. Chein
Discrete Mathematics
1
(2), 1971, pp. 147-166
Investigations on an edge coloring problem
D. de Werra
Discrete Mathematics
1
(2), 1971, pp. 167-179
Enumerating
k
-trees
Dominique Foata
Discrete Mathematics
1
(2), 1971, pp. 181-186
The homology of a lattice
Harry Lakser
Discrete Mathematics
1
(2), 1971, pp. 187-192
Hyperplane cuts of an
n
-cube
Patrick E. O'Neil
Discrete Mathematics
1
(2), 1971, pp. 193-195
A constructive decomposition and Fulkerson's characterization of permutation matrices
Patrick E. O'Neil
Discrete Mathematics
1
(2), 1971, pp. 197-201
On the 2-factors of bicubic graphs
W.T. Tutte
Discrete Mathematics
1
(2), 1971, pp. 203-208
L'épaisseur du graphe complet de 46 sommets
Jean Mayer
Discrete Mathematics
1
(2), 1971, pp. 209-210
Polyhedral realization in
R^3
of triangulations of the torus and 2-manifolds in cyclic 4-polytopes
Amos Altshuler
Discrete Mathematics
1
(3), 1971, pp. 211-238
Note on the
p
-adic generalization of Lorentz transformations
E.G. Beltrametti
Discrete Mathematics
1
(3), 1971, pp. 239-246
More on the generalized Macaulay theorem
G.F. Clements
Discrete Mathematics
1
(3), 1971, pp. 247-255
Homomorphisms of derivative graphs
Jaroslav Nes̑etȓil
Discrete Mathematics
1
(3), 1971, pp. 257-268
Meshes on 3-connected graphs
Gert Sabidussi
Discrete Mathematics
1
(3), 1971, pp. 269-276
Seiten 1
2
>