Branchwidth is \((1, g)\)-self-dual
From MaRDI portal
Publication:6126712
DOI10.1016/j.dam.2024.02.003arXiv2305.18069OpenAlexW4392437604MaRDI QIDQ6126712
Alexandros Leivaditis, Georgios Kontogeorgiou, Kostas I. Psaromiligkos, Giannos Stamoulis, Dimitris Zoros
Publication date: 10 April 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.18069
Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outerplanar obstructions for matroid pathwidth
- On self-duality of branchwidth in graphs of bounded genus
- Tree-width of hypergraphs and surface duality
- Connected graph searching
- 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
- Branch-width and well-quasi-ordering in matroids and graphs.
- The branchwidth of graphs and their cycle matroids
- The point-set embeddability problem for plane graphs
- Approximation of pathwidth of outerplanar graphs
- Pathwidth of outerplanar graphs
- On self duality of pathwidth in polyhedral graph embeddings
- How to draw a hypergraph
- On the Path-Width of Planar Graphs
- Matroid Pathwidth and Code Trellis Complexity
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
This page was built for publication: Branchwidth is \((1, g)\)-self-dual
