A 3-approximation for the pathwidth of Halin graphs

Fedor V. Fomin, Dimitrios M. Thilikos

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that the pathwidth of Halin graphs can be approximated within a factor of 3.

Original languageEnglish (US)
Pages (from-to)157-162
Number of pages6
JournalElectronic Notes in Discrete Mathematics
Volume17
DOIs
StatePublished - Oct 20 2004

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A 3-approximation for the pathwidth of Halin graphs'. Together they form a unique fingerprint.

Cite this