Pathwidth of outerplanar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Pathwidth of outerplanar graphs

Abstract

We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c$ such that the pathwidth of every biconnected outerplanar graph is at most $c$ plus the pathwidth of its dual. They also conjectured that this was actually true with $c$ being $1$ for every biconnected planar graph. Fomin proved that the second conjecture is true for all planar triangulations, and made a stronger conjecture about the linear width of planar graphs. First, we construct for each p>=1 a biconnected outerplanar graph of pathwidth 2p+1 whose (geometric) dual has pathwidth p+1, thereby disproving all three conjectures. Then we prove, in an algorithmic way, that the pathwidth of every biconnected outerplanar graph is at most twice the pathwidth of its (geometric) dual minus 1. A tight interval for the studied relation is therefore obtained, and we show that all the gaps within the interval actually happen.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5804.pdf (134.78 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070220 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070220 , version 1

Cite

David Coudert, Florian Huc, Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. [Research Report] RR-5804, INRIA. 2006, pp.12. ⟨inria-00070220⟩
172 View
617 Download

Share

Gmail Facebook Twitter LinkedIn More