|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 3, Pages 20–46
(Mi da572)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Partition of a planar graph with girth 7 into two star forests
D. Zh. Zambalayeva S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
Abstract:
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.
Received: 11.12.2008 Revised: 24.02.2009
Citation:
D. Zh. Zambalayeva, “Partition of a planar graph with girth 7 into two star forests”, Diskretn. Anal. Issled. Oper., 16:3 (2009), 20–46
Linking options:
https://www.mathnet.ru/eng/da572 https://www.mathnet.ru/eng/da/v16/i3/p20
|
Statistics & downloads: |
Abstract page: | 364 | Full-text PDF : | 94 | References: | 57 | First page: | 7 |
|