Partition of a planar graph with girth 7 into two star forests

MaRDI QIDQ3115179zbMATH OpenFDO

Authors D. Zh. Zambalaeva

Publication date 20 February 2012

zbMATH Keywords

girthpath partitionplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• Partitioning a planar graph of girth 10 into a forest and a matching
• scientific article; zbMATH DE number 1882351
• Partitioning sparse plane graphs into two induced subgraphs of small degree
• scientific article; zbMATH DE number 6125173

Cited in

(4)

• Partitioning a planar graph of girth 10 into a forest and a matching
• Partitions of some planar graphs into two linear forests
• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• Note on partitions of planar graphs

This page was built for publication: Partition of a planar graph with girth 7 into two star forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115179)