1. A. Bernáth, A note on the directed source location algorithm, Egerváry Research Report, 2004-12.
2. P. Duchet, Hypergraphs (Theorem 3.8), in: R. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Elsevier, Amsterdam, 1995, pp. 381–432.
3. A. Frank, Some polynomial algorithms for certain graphs and hypergraphs, in: C. Nash-Williams, J. Sheehan (Eds.), Proceedings of the Fifth British Combinatorial Conference, (1975) Congressus Numerantium XV, pp. 211–226.
4. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph;Gavril;SIAM J. Comput.,1972
5. A faster algorithm for finding the minimum cut in a graph;Hao;J. Algorithms,1994