1. Aichholzer, O., Asinowski, A., Miltzow, T.: Disjoint compatibility graph of non-crossing matchings of points in convex position. Electron. J. Combin. 22(1), 53 (2015). https://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p65. Paper 1.65
2. Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. Graphs Combin. 23(5), 467–479 (2007). https://doi.org/10.1007/s00373-007-0750-z
3. Lecture Notes in Computer Science;O Aichholzer,2019
4. Berry, L.A., Reed, B., Scott, A., Wood, D.R.: A logarithmic bound for the chromatic number of the associahedron. arXiv:1811.08972 (2018)
5. Ceballos, C., Santos, F., Ziegler, G.M.: Many non-equivalent realizations of the associahedron. Combinatorica 35(5), 513–551 (2014). https://doi.org/10.1007/s00493-014-2959-9