[1] C. BERGE: Graphs and hypergraphs. North-Holland, Amsterdam, 1972. MR 0809587

[2] V. CHVÁTAL: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 (1973), 305-337. MR 0313080

[3] S. A. COOK: The complexity of theorem-proving procedures. in: Conference record of the third ACM symposium on theory of computing (1970), 151-158.

[4] R. M. KARP: Reducibility among combinatorial problems. in: R. E. Miller et al., eds., Complexity of computer computations (Plenum Press, New York, 1972). MR 0378476