1. F. Harary and E. M. Palmer, Graphical Enumeration (Academic, New York–London, 1973; Mir, Moscow, 1977).
2. G. W. Ford and G. E. Uhlenbeck, “Combinatorial problems in the theory of graphs. IV,” Proc. Nat. Acad. Sci. U. S. A. 43, 163–167 (1957).
3. J. G. Stemple and M. E. Watkins, “On planar geodetic graphs,” J. Combin. Theory 4, 101–117 (1968).
4. M. Drmota, É. Fusy, M. Kang, V. Kraus, and J. Rue, “Asymptotic study of subcritical graph classes,” SIAM J. DiscreteMath. 25 (4), 1615–1651 (2011).
5. C. E. Frasser, “k-Geodetic graphs and their application to the topological design of computer networks,” Proc. Argentinian Workshop on Theoretical Computer Science, 28 JAIIO-WAIT’99 (1999), pp. 187–203.