1. Abrahamsen, M., Bodwin, G., Rotenberg, E., Stöckel, M.: Graph reconstruction with a betweenness oracle. In: 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 47, pp. 5:1–5:14 (2016)
2. Aigner, M., Triesch, E.: Reconstructing a graph from its neighborhood lists. Comb. Probab. Comput. 2, 103–113 (1993)
3. Beineke, L., Schmeichel, E.: Degrees and cycles in graph. In: 2nd International Conference on Combinatorial Mathematics, pp. 64–70 (1979)
4. Ben-Moshe, B., Dvir, A., Segal, M., Tamir, A.: Centdian computation in cactus graphs. J. Graph Algorithms Appl. 16(2), 199–224 (2012)
5. Bıyıkoğlu, T.: Degree sequences of Halin graphs, and forcibly cograph-graphic sequences. Ars Combinatoria 75, 205–210 (2005)