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: Author="Milner, E.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a conjecture of Rödl and Voigt
P. Komjáth
,
E.C. Milner
Journal of Combinatorial Theory Series B
61
(2), 1994, pp. 199-209
Unfriendly partitions of a graph
R. Aharoni
,
E.C. Milner
,
K. Prikry
Journal of Combinatorial Theory Series B
50
, 1990, pp. 1-10
On directed graphs with an independent covering set
E.C. Milner
,
Robert E. Woodrow
Graphs and Combinatorics
5
, 1989, pp. 363-369
A compactness theorem for perfect matchings in matroids
P. Komjath
,
E.C. Milner
,
N. Polat
Journal of Combinatorial Theory Series B
44
(3), 1988, June, pp. 253-262
Independent transversals for countable set systems
E.C. Milner
Journal of Combinatorial Theory Series A
19
, 1975, pp. 125-133
Necessary and sufficient conditions for transversals of countable set systems
M.R. Damerell
,
E.C. Milner
Journal of Combinatorial Theory Series A
17
, 1974, pp. 350-374
On the average size of the sets in a Sperner family
D.J. Kleitman
,
E.C. Milner
Discrete Mathematics
6
, 1973, pp. 141-147