1. Aigner, M.: Graph Theory. A Development from the 4-Color Problem. BCS Association (1987)
2. Blanc, J.: The best polynomial bounds for the number of triangles in a simple arrangement of $$n$$ pseudo-lines. Geombinatorics 21, 5–17 (2011)
3. Felsner, S., Hurtado, F., Noy, M., Streinu, I.: Hamiltonicity and colorings of arrangement graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 155–164 (2000)
4. Felsner, S., Hurtado, F., Noy, M., Streinu, I.: Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154(17), 2470–2483 (2006)
5. Felsner, S., Scheucher, M.: Webpage: Homepage of pseudocircles. http://www3.math.tu-berlin.de/pseudocircles