an:06466089
Zbl 1324.05034
Glebov, A. N.; Zambalaeva, D. Zh.
Partition of a planar graph with girth 6 into two forests with chain length at most 4
RU EN
Diskretn. Anal. Issled. Oper. 21, No. 2, 33-51 (2014); translation in J. Appl. Ind. Math. 8, No. 3, 317-328 (2014).
1560-7542
2014
j
05C10 05C38 05C70
planar graph; girth; path partition
Summary: We prove that the vertex set of every planar graph with girth at most 6 can be partitioned into two subsets each of which generates a forest in which the length of each chain does not exceed 4.