Sciweavers

2 search results - page 1 / 1
» On self duality of pathwidth in polyhedral graph embeddings
Sort
View
JGT
2007
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
COLOGNETWENTE
2009
13 years 7 months ago
On Self-Duality of Branchwidth in Graphs of Bounded Genus
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...
Ignasi Sau, Dimitrios M. Thilikos