1. Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K., Neuwirth, D., Reislhuber, J. Outer 1-planar graphs. Algorithmica, 74(4): 1293–1320 (2016)
2. Bonamy, M., Perrett, T., Postle, L. Colouring graphs with sparse neighbourhoods: Bounds and applications. arXiv: 1810.06704 (2018)
3. Bonamy, M., Perrett, T., Postle, L. Colouring graphs with sparse neighbour-hoods: Bounds and applications. Journal of Combinatorial Theory, Series B, 155: 278–317 (2022)
4. Bruhn, H., Joos, F. A stronger bound for the strong chromatic index. Electronic Notes in Discrete Mathematics. The Eight European Conference on Combinatorics, Graph Theory and Applications, 49: 277–284 (2015)
5. Eggleton, R. Rectilinear drawings of graphs. Utilitas Mathematica, 29: 149–172 (1986)