85views more  JGT 2007»
13 years 6 months ago
On self duality of pathwidth in polyhedral graph embeddings
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
Fedor V. Fomin, Dimitrios M. Thilikos