1. Complexity and Approximation (Combinatorial Optimization Problems and their Approximability Properties);Ausiello,1999
2. Free bits, PCPs and non-approximability — towards tight results;Bellare;SIAM J. Comput.,1998
3. P. Berman, M. Karpinski, A.D. Scott, Approximation hardness and satisfiability of bounded occurrence instances of SAT, in: Electronic Colloquium on Computational Complexity, ECCC, 2003
4. On colouring nodes of a network;Brooks;Proc. Cambridge Philos. Soc.,1941
5. Paths, trees and flowers;Edmonds;Canad. J. Math.,1965