1. Allgeier, B.: Structure and properties of maximal outerplanar graphs. Ph.D. thesis (2009)
2. de Araújo, P.H.M., Campêlo, M.B., Corrêa, R.C., Labbé, M.: The geodesic classification problem on graphs. In: Proceedings of the 10th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS. Electronic Notes in Theoretical Computer Science, vol. 346, pp. 65–76. Elsevier (2019)
3. Borgatti, S., Everett, M.: Models of core/periphery structures. Soc. Netw. 21, 375–395 (1999)
4. Bressan, M., Cesa-Bianchi, N., Lattanzi, S., Paudice, A.: Exact recovery of clusters in finite metric spaces using oracle queries. In: COLT 2021. Proceedings of Machine Learning Research, vol. 134, pp. 775–803. PMLR (2021)
5. Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l’I.H.P. Probabilités et statistiques 3(4), 433–438 (1967)