[1] COOK S. A.: The complexity of theorem proving procedures. In: Proc. Зrd ACM Sуmp. oii the Тheоrу of Cоmputing, ACM, 1971, pp. 151-158. Zbl 0253.68020

[2] GAVALEC M.: Computational complexity of consistent choice. In: Proc. 5th Conf. of EF TU, Math. Sect., Košice, 1992, pp. 70-74.

[3] GAVALEC M.-HUDEC O.: Balanced location on a graph. Optimization 35 (1995), 367-372. MR 1396231 | Zbl 0874.90114

[4] KNUTH D. E.-RAGHUNATHAN A.: The problem of compatible representatives. SIAM J. Discrete Math. 5 (1992), 422 427. MR 1172750 | Zbl 0825.68494

[5] Algorithms and Complexity. Handbook of Theoretical Computer Science, rol. A (J. van Leeuven, ed.), Elsevier, Amsterdam, 1990. Zbl 0925.68008

[6] TARJAN R. E.: Depth-first search and linear graph algorithm. SIAM J. Comput. 1 ( 1972). 146-160. MR 0304178