On self-duality of branchwidth in graphs of bounded genus

DOI10.1016/j.dam.2011.06.028zbMath1237.05135OpenAlexW2177573564MaRDI QIDQ411870

Dimitrios M. Thilikos, Ignasi Sau

Publication date: 30 April 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.028

zbMATH Keywords

dualitypolyhedral embeddinggraphs on surfacesbranchwidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Branchwidth is \((1, g)\)-self-dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Graph minors. III. Planar tree-width
• Graph minors. X: Obstructions to tree-decomposition
• Call routing and the ratcatcher
• Chordal embeddings of planar graphs
• The branchwidth of graphs and their cycle matroids
• Tree-width of graphs and surface duality
• Approximation of pathwidth of outerplanar graphs
• Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
• On self duality of pathwidth in polyhedral graph embeddings
• On the Path-Width of Planar Graphs

This page was built for publication: On self-duality of branchwidth in graphs of bounded genus