Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. Accurso, C., Chernyshov, V., Hand, L., Jahanbekam, S., Wenger. P.: Weak dynamic coloring of planar graphs. arXiv:1802.05953
2. Angelini, P., Bekos, M.A., Kaufmann, M., Schneck, T.: Efficient generation of different topological representations of graphs beyond-planarity. In: Toth, C.D., Archambault, D. (eds.) Proceedings of 27th International Symposium on Graph Drawing (GD 2019) (2019)
3. Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23–49 (2018)
4. Borodin, O.: A new proof of the 6 color theorem. J. Graph Theory 19(4), 507–521 (1995)
5. Borodin, O.V.: Solution of the ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskretnogo Analiza 108(41), 12–26 (1984)