Abstract
We prove that the pathwidth of Halin graphs can be approximated within a factor of 3.
Original language | English (US) |
---|---|
Pages (from-to) | 157-162 |
Number of pages | 6 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 17 |
DOIs | |
State | Published - Oct 20 2004 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics