1. Weight of 3-paths in sparse plane graphs;Aksenov;Electron. J. Combin.,2015
2. Every 3-connected planar graph has a connected subgraph with small degree sum;Ando;Ann. Meeting Math. Soc. Japan,1993
3. Covering planar graphs with forests;Balogh;J. Combin. Theory Ser. B,2005
4. On the total coloring of planar graphs;Borodin;J. Reine Angew. Math.,1989
5. Joint generalization of the theorems of Lebesgue and Kotzig on the combinatorics of planar maps;Borodin;Diskret. Mat.,1991