tom Dieck, Tammo Partitions of unity in homotopy theory. (English) Zbl 0212.55804 Compos. Math. 23, 159-167 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 23 Documents MSC: 55P99 Homotopy theory PDFBibTeX XMLCite \textit{T. tom Dieck}, Compos. Math. 23, 159--167 (1971; Zbl 0212.55804) Full Text: Numdam EuDML References: [1] R. Brown [1] Elements of Modern Topology . McGraw-Hill, London (1968). · Zbl 0159.52201 [2] R. Brown AND P.R. Heath [2] Coglueing Homotopy Equivalences . Math. Z. 113, 313-325 (1970). · Zbl 0185.51101 [3] T. Tom Dieck , K.H. Kamps AND D. Puppe [3] Homotopietheorie . Springer Lecture Notes Vol. 157 (1970). · Zbl 0203.25401 [4] A. Dold [4] Partitions of unity in the theory of fibrations . Ann. of Math. 78, 223-255 (1963). · Zbl 0203.25402 [5] A. Dold [5] Local extention properties in topology . Proc. Adv. Study Inst. Alg. Top., Aarhus (1970). · Zbl 0226.55014 [6] J.E. Eells , AND Kuiper, N.H. [6] Homotopy negligible subsets . Compositio math. 21, 155-161 (1965). · Zbl 0181.51401 [7] P. Gabiel AND M. Zisman [7] Calculus of fractions and homotopy theory . Springer-Verlag, Berlin-Heidelberg -New York (1967). · Zbl 0186.56802 [8] M. Mccord [8] Singular homology groups and homotopy groups of finite topological spaces . Duke Math. J. 33, 465-474 (1966). · Zbl 0142.21503 [9] J. Milnor [9 ] On spaces having the homotopy type of a CW-complex . Trans. Amer. Math. Soc. 90, 272-280 (1959). · Zbl 0084.39002 [10] J. Milnor [10] Morse theory . Princeton Univ. Press, Princeton (1963). · Zbl 0108.10401 [11] G. Segal [11] Classifying spaces and spectral sequences . Publ. math. I.H.E.S. 34,105-112 (1968). · Zbl 0199.26404 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.