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

DOI10.1016/J.ENDM.2008.06.033MaRDI QIDQ5301001zbMATH OpenOpenAlexFDO

Authors

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

edge partitionforestsplanar graphstrees

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)

Recommendations

• Covering planar graphs with forests, one having bounded maximum degree
• Covering projective planar graphs with three forests
• Covering planar graphs with forests
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• On the vertex partition of planar graphs into forests with bounded degree

Cites work

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

Cited in

(10)

• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests
• Covering projective planar graphs with three forests
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• Equating maximum degrees in graphs without short cycles
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• scientific article; zbMATH DE number 31761 (Why is no real title available?)
• scientific article; zbMATH DE number 1953106 (Why is no real title available?)
• scientific article; zbMATH DE number 1556750 (Why is no real title available?)
• Partitioning edges of a planar graph into linear forests and a matching

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

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