Volume 21, No 2, 2014, P. 33–51
A. N. Glebov, D. Zh. Zambalaeva
A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4
We prove that every planar graph with girth at least 6 has a vertex partition into two forests containing no path of length greater than 4.
Ill. 7, bibliogr. 9.
Keywords: planar graph, girth, path partition.
Glebov Aleksey Nikolaevich 1,2
Zambalaeva Dolgor Zhamyanovna 1
1. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: email@example.com, firstname.lastname@example.org