On self duality of pathwidth in polyhedral graph embeddings

DOI10.1002/JGT.20219MaRDI QIDQ3445501zbMATHOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

dualityembeddingspathwidth

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• Pathwidth of planar and line graphs
• The connectivity of the dual
• On the path-width of planar graphs
• Tree-width of hypergraphs and surface duality
• On self-duality of branchwidth in graphs of bounded genus
• On local operations that preserve symmetries and on preserving polyhedrality of maps
• Branchwidth is \((1, g)\)-self-dual
• Self‐dual embeddings of complete multipartite graphs
• A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
• Nondeterministic graph searching: from pathwidth to treewidth
• 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)