Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
SIAM Journal on Computing
The branchwidth of graphs and their cycle matroids
Journal of Combinatorial Theory Series B
On self duality of pathwidth in polyhedral graph embeddings
Journal of Graph Theory
On the Path-Width of Planar Graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.04 |
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 by more than a constant factor. Self-duality has been examined for several width parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we prove that bw(G^*)@?6@?bw(G)+2g-4 for any graph G embedded in a surface of Euler genus g.