A 3-approximation for the pathwidth of Halin graphs

We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings of trees. Using this result we prove that the linear width of Halin graph is always at most three times the linear width of its skeleton.

• Type: Journal
• Year: 2006
• Where: JDA
• Authors: Fedor V. Fomin, Dimitrios M. Thilikos
• Keywords: Halin Graph, JDA 2006, Linear Width, Respectful Edge Orderings