Covering planar graphs with forests, one having a bounded maximum degree

DOI10.1016/J.ENDM.2008.06.033zbMath1267.05205OpenAlexW1981793223MaRDI QIDQ5301001

No author found.

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.033

zbMATH Keywords

planar graphstreesforestsedge partition

Mathematics Subject Classification ID

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

Cites Work

• Decomposing a planar graph with girth 9 into a forest and a matching
• Covering planar graphs with forests
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Caterpillar arboricity of planar graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Covering planar graphs with forests, one having a bounded maximum degree