1. Bokal, D., Dvořák, Z., Hliněný, P., Leaños, J., Mohar, B., Wiedera, T.: Bounded degree conjecture holds precisely for c-crossing-critical graphs with c $$\le $$ 12. In: Symposium on Computational Geometry. LIPIcs, vol. 129, pp. 14:1–14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019). Full and improved version on arXiv:1903.05363
2. Chimani, M., Wiedera, T.: An ILP-based proof system for the crossing number problem. In: ESA 2016. LIPIcs, vol. 57, pp. 29:1–29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
3. Dvořák, Z., Hliněný, P., Mohar, B.: Structure and generation of crossing-critical graphs. In: Symposium on Computational Geometry. LIPIcs, vol. 99, pp. 33:1–33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
4. Dvořák, Z., Mohar, B.: Crossing-critical graphs with large maximum degree. J. Comb. Theory Ser. B 100(4), 413–417 (2010)
5. Kochol, M.: Construction of crossing-critical graphs. Discret. Math. 66(3), 311–313 (1987)