2 search results - page 1 / 1 » On self duality of pathwidth in polyhedral graph embeddings |
JGT
2007
13 years 4 months ago
2007
: 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...
COLOGNETWENTE
2009
13 years 5 months ago
2009
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been...