Structural similarity between polyhedral embeddings and their duals and its application to self-duality of pathwidth

TL;DR

This paper establishes a new bound relating the pathwidth of a polyhedral graph embedding on a surface to its dual, improving previous bounds and highlighting structural similarities between embeddings and their duals.

Contribution

It introduces a tighter bound on the pathwidth of dual graphs in polyhedral embeddings, extending previous results and applying to face subdivisions.

Findings

Bound:  ext{pw}(G^*) \u2264 3 ext{pw}(G) + c

Improved coefficient over previous bounds by Fomin and Thilikos (2007)

Extended results to face subdivisions of embeddings

Abstract

Let $G$ be a graph embedded on a closed surface. We call $G$ a \emph{polyhedral embedding} if all facial walks are cycles, and any two of them are either disjoint or intersect in a single vertex or a single edge. In this paper, we present a new bound on the relation between the pathwidth of a polyhedral embedding and its dual. More precisely, we prove that for a polyhedral embedding $G$ on a closed surface with Euler characteristic $\chi$, $\mathsf{pw}(G^*) \leq 3\ \mathsf{pw}(G)+c$, where $c$ is a constant depending only on $\chi$. This result improves the coefficient of $\mathsf{pw}(G)$ in the previously known bound by Fomin and Thilikos (2007) and extends that of Amini, Huc, and P\'erennes (2009) for plane graphs. Furthermore, we obtain analogous bounds on the treewidth and pathwidth of the face subdivision of a polyhedral embedding. Our approach is based on a new quantitative estimate which demonstrates the structural similarity between a polyhedral embedding and its dual.