1. K. Ando, S. Iwasaki, A. Kaneko, Every 3-connected planar graph has a connected subgraph with small degree sum (Japanese), in: Annual Meeting of Mathematical Society of Japan, 1993.
2. Covering planar graphs with forests;Balogh;J. Combin. Theory Ser. B,2005
3. On the total coloring of planar graphs;Borodin;J. Reine Angew. Math.,1989
4. Joint extension of two Kotzig’s theorems on 3-polytopes;Borodin;Combinatorica,1993
5. Minimal vertex degree sum of a 3-path in plane maps;Borodin;Discuss. Math. Graph Theory,1997