Kirkpatrick, David G.; Hell, Pavol On the completeness of a generalized matching problem. (English) Zbl 1282.68182 Proceedings of the 10th annual ACM symposium on theory of computing, STOC’78, San Diego, CA, USA, May 1–3, 1978. New York, NY: Association for Computing Machinery (ACM). 240-245 (1978). Cited in 2 ReviewsCited in 69 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C07 Vertex degrees PDFBibTeX XMLCite \textit{D. G. Kirkpatrick} and \textit{P. Hell}, in: Proceedings of the 10th annual ACM symposium on theory of computing, STOC'78, San Diego, CA, USA, May 1--3, 1978. New York, NY: Association for Computing Machinery (ACM). 240--245 (1978; Zbl 1282.68182) Full Text: DOI