Author:
Borodin O. V.,Ivanova A. O.
Reference22 articles.
1. Wernicke P., “Über den kartographischen Vierfarbensatz,” Math. Ann., vol. 58, no. 3, 413–426 (1904).
2. Franklin P., “The four color problem,” Amer. J. Math., vol. 44, no. 3, 225–236 (1922).
3. Aksenov V. A., Borodin O. V., and Ivanova A. O., “Weight of 3-paths in sparse plane graphs,” Electron. J. Combin., vol. 22, no. 3, P3.28 (2015).
4. Ando K., Iwasaki S., and Kaneko A., “Every $ 3 $-connected planar graph has a connected subgraph with small degree sum,” Annu. Meeting Math. Soc. Japan, vol. 11, 507–515 (1993).
5. Borodin O. V., “Solution of Kotzig’s and Grübaum’s problems on the separability of a cycle in a planar graph,” Math. Notes, vol. 46, no. 5, 835–837 (1989).