1. Bollobas, B. ”Graph Theory”, Springer-Verlag (1979).
2. Caccetta, L.; Haggkvist, R. ”On diameter critical graphs”, Discrete Math. 28(3) (1979), pp. 223– 229.
3. Plesnik, J. ”Critical graphs of given diameter”, Acta F.R.N. Univ. comenianae Math. 30 (1975), pp. 71–93.
4. Balbuena, C.; Hansberg, A.; Haynes, T.W.; Henning, M.A. ”Total domination edge critical graphs with total domination number three and many dominating pairs”, Graphs Combin. 31 (5) (2015), pp. 1163–1176.
5. Dailly, A.; Foucaud, F.; Hansberg, A. ”Strengthening the Murty-Simon conjecture on diameter- 2-critical graphs”, Discrete Mathematics, Elsevier 342 (11) (2019), pp. 3142–3159.
6. Fan, G. ”On diameter 2-critical graphs”, Discrete Math. 67 (3) (1987), pp. 235–240
7. McKay, B. D. ”Practical graph isomorphism”, Congr. Numer. (30) (1980), pp. 45—87.
8. McKay, B. D. and Piperno, A. ”Practical Graph Isomorphism, II”, J. Symbolic Computation (60) (2013), pp. 94–112.
9. Cormen, T. H.; Leiserson C. E.; Rivest R. L.; Stein C. ”Introduction to Algorithms Third Edition”, The MIT Press (2009), pp. 594–602.
10. Radosavljevi´c, J.; Zivkovi ˇ ´c, M. ”The List of Diameter-2-Critical Graphs with at Most 10 Nodes”, IPSI Transactions (2020).
...