Kirkpatrick, D. G.; Hell, P. On the complexity of general graph factor problems. (English) Zbl 0525.68023 SIAM J. Comput. 12, 601-609 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 92 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:graph factor; matching; NP-completeness PDFBibTeX XMLCite \textit{D. G. Kirkpatrick} and \textit{P. Hell}, SIAM J. Comput. 12, 601--609 (1983; Zbl 0525.68023) Full Text: DOI