Geodesic
Partition of a~planar graph with girth~7 into two star forests
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 20-46

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove that the vertex set of any planar graph with girth at least 7 can be partitioned into two subsets such that each subset induces a star forest, i.e. a collection of vertex disjoint paths. Bibl. 26.
Keywords: planar graph, girth, path partition. 
@article{DA_2009_16_3_a1,
     author = {D. Zh. Zambalayeva},
     title = {Partition of a~planar graph with girth~7 into two star forests},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {20--46},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_3_a1/}
}
TY  - JOUR
AU  - D. Zh. Zambalayeva
TI  - Partition of a~planar graph with girth~7 into two star forests
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 20
EP  - 46
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_3_a1/
LA  - ru
ID  - DA_2009_16_3_a1
ER  - 
%0 Journal Article
%A D. Zh. Zambalayeva
%T Partition of a~planar graph with girth~7 into two star forests
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 20-46
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_3_a1/
%G ru
%F DA_2009_16_3_a1
D. Zh. Zambalayeva. Partition of a~planar graph with girth~7 into two star forests. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 20-46. http://geodesic.mathdoc.fr/item/DA_2009_16_3_a1/