References
- J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, Berlin, 2008.
- O. V. Borodin, Solution of the Ringel problems on vertex-face coloring of planar graphs and coloring of 1-planar graphs, Metody Discret. Anal. 41 (1984), 12-26.
- O. V. Borodin, On the total coloring of planar graphs, J. Reine Angew. Math. 394 (1989), 180-185.
- O. V. Borodin, A. V. Kostochka, A. Raspaud, and E. Sopena, Acyclic colouring of 1-planar graphs, Discrete Math. 114 (2001), no. 1-3, 29-41. https://doi.org/10.1016/S0166-218X(00)00359-0
- J. Czap and D. Hudak, On drawings and decompositions of 1-planar graphs, Electron. J. Combin. 20 (2013), no. 2, 54-60.
- I. Fabrici and T. Madaras, The structure of 1-planar graphs, Discrete Math. 307 (2007), no. 7-8, 854-865. https://doi.org/10.1016/j.disc.2005.11.056
- B. Grunbaum, New views on some old questions of combinatorial geometry, IColloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo I, pp. 451-468. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976.
- D. Hudak and P. Sugerek, Light edges in 1-planar graphs with prescribed minimum degree, Discuss. Math. Graph Theory 32 (2012), no. 3, 545-556. https://doi.org/10.7151/dmgt.1625
- S. Jendrol and H.-J. Voss, Light subgraphs of graphs embedded in the plane-A survey, Discrete Math. 313 (2013), no. 4, 406-421. https://doi.org/10.1016/j.disc.2012.11.007
- A. Kotzig, Contribution to the theory of Eulerian polyhedra, Mat.-Fyz. Caspis. Slovensk. Akad. Vied (Math. Slovaca) 5 (1955), 101-113.
- X. Zhang, Light 3-cycles in 1-planar graphs with degree restrictions, Bull. Korean Math. Soc. 51 (2014), no. 2, 511-517. https://doi.org/10.4134/BKMS.2014.51.2.511
- X. Zhang and J. Wu, On edge colorings of 1-planar graphs, Inform. Process. Lett. 111 (2011), no. 3, 124-128. https://doi.org/10.1016/j.ipl.2010.11.001
- X. Zhang and J. Wu, On edge colorings of 1-planar graphs without adjacent triangles, Inform. Process. Lett. 112 (2012), no. 4, 138-142. https://doi.org/10.1016/j.ipl.2011.10.021