×

zbMATH — the first resource for mathematics

Partition of a planar graph with girth 7 into two star forests. (Russian) Zbl 1249.05317
Summary: 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.

MSC:
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C10 Planar graphs; geometric and topological aspects of graph theory
05C38 Paths and cycles
PDF BibTeX XML Cite