On self duality of pathwidth in polyhedral graph embeddings

DOI10.1002/JGT.20219zbMATH Open1117.05028DBLPjournals/jgt/FominT07OpenAlexW4240497371WikidataQ60488757 ScholiaQ60488757MaRDI QIDQ3445501FDOQ3445501

Authors: 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

Recommendations

• On the path-width of planar graphs
• Pathwidth of planar and line graphs
• Approximation of pathwidth of outerplanar graphs
• On self-duality of branchwidth in graphs of bounded genus
• Pathwidth of outerplanar graphs

zbMATH Keywords

dualityembeddingspathwidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• The search and the node-search number of dual graphs

Cited In (10)

• A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface
• Pathwidth of planar and line graphs
• On self-duality of branchwidth in graphs of bounded genus
• On local operations that preserve symmetries and on preserving polyhedrality of maps
• On the path-width of planar graphs
• Self‐dual embeddings of complete multipartite graphs
• Nondeterministic graph searching: from pathwidth to treewidth
• The connectivity of the dual
• Branchwidth is \((1, g)\)-self-dual
• Dynamic programming for graphs on surfaces

This page was built for publication: On self duality of pathwidth in polyhedral graph embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445501)