On self duality of pathwidth in polyhedral graph embeddings
From MaRDI portal
Publication:3445501
DOI10.1002/jgt.20219zbMath1117.05028OpenAlexW4240497371WikidataQ60488757 ScholiaQ60488757MaRDI QIDQ3445501
Fedor V. Fomin, Dimitrios M. Thilikos
Publication date: 11 June 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20219
Related Items (6)
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface ⋮ On local operations that preserve symmetries and on preserving polyhedrality of maps ⋮ On self-duality of branchwidth in graphs of bounded genus ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Nondeterministic graph searching: from pathwidth to treewidth ⋮ Dynamic programming for graphs on surfaces
Cites Work
This page was built for publication: On self duality of pathwidth in polyhedral graph embeddings
