K-planar graphs

References:

1. Kobourov, Stephen G., Giuseppe Liotta, and Fabrizio Montecchiani. "An annotated bibliography on 1-planarity." Computer Science Review 25 (2017): 49-67.

2. Vida Dujmović, David Eppstein, and David R. Wood. Structure of graphs with locally restricted crossings. SIAM J. Discrete Math., 31(2):805–824, 2017. 

3. J. Pach and G. T´oth. Graphs drawn with few crossings per edge. Combinatorica, 17(3):427–439, 1997.

4. R. Bodendiek, H. Schumacher, and K. Wagner. Uber 1-optimale Graphen. Mathematische Nachrichten, 117(1):323–339, 1984.

5. Y. Suzuki, K_7-minors in optimal 1-planar graphs, Discrete Math. 340 (2017), 1227–1234.

6. A. Grigoriev, H. L. Bodlaender, Algorithms for graphs embeddable with few crossings per edge, Algorithmica 49 (2007), 1–11.

7. V. P. Korzhik, B. Mohar, Minimal obstructions for 1-immersions and hardness of 1-planarity testing, J. Graph Theory 72 (2013), 30–71

8. Zhang, Licheng, and Yuanqiu Huang. "The reducibility of optimal 1-planar graphs with respect to the lexicographic product." arXiv preprint arXiv:2211.14733 (2022).

9. Y. Suzuki, Re-embeddings of maximum 1-planar graphs, SIAM J. Discrete Math. 24 (2010), 1527–1540.

10. Ringel G, Ein sechsfarbenproblem auf der Kugel, Abh. Math. Semin. Univ. Hambg., 29 (1965), pp. 107-117

11. I. Fabrici, J. Harant, T. Madaras, S. Mohr, R. Sot´ak, and C. T. Zamfirescu, Long cycles and spanning subgraphs of locally maximal 1-planar graphs, J. Graph Theory 95 (2020), 125–137.

12. K. Noguchi and Y. Suzuki, Relationship among triangulations, quadrangulations and optimal 1-planar graphs, Graphs and Combin. 31 (2015), 1965–1972.

13. Brandenburg, Franz J. "Recognizing optimal 1-planar graphs in linear time." Algorithmica 80 (2018): 1-28.