1. M. Abreu, S.C. Locke, Non-separating n-trees up to diameter 4 in a (2n+2)-cohesive graph, in: Proceedings of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, 2002, Congr. Numer. 154 (2002) 21–30
2. Problem 10647;Locke;MAA Monthly,1998
3. Highly cohesive graphs have long non-separating paths: Solution to Problem 10647;Locke;MAA Monthly,2001
4. Combinatorial Problems and Exercises;Lovász,1979
5. Existenz gewisser Konfigurationen in n-gesättigten Graphen und in Graphen genügend großer Kantendichte;Mader;Math. Ann.,1971