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”, Diskretn. Anal. Issled. Oper., 2014, Volume 21, Issue 2,Pages <nobr>33

This article is cited in 4 papers

A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4

A. N. Glebov^ab, D. Zh. Zambalaeva^a

^a S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
^b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: 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.

UDC: 519.8

Received: 25.12.2012
Revised: 21.11.2013