Thin trees in 8-edge-connected planar graphs

DOI10.1016/j.ipl.2018.11.009zbMath1481.05038OpenAlexW2902703949MaRDI QIDQ1711432

Ramin Mousavi

Publication date: 18 January 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.11.009

zbMATH Keywords

algorithmdecompositionedge-coloringplanar graphthin tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a graph into forests
• Decomposing a planar graph with girth 9 into a forest and a matching
• Bounded diameter arboricity

This page was built for publication: Thin trees in 8-edge-connected planar graphs