Tree-width of hypergraphs and surface duality

DOI10.1016/j.jctb.2011.11.002zbMath1241.05102OpenAlexW1986576219MaRDI QIDQ414640

Frédéric Mazoit

Publication date: 11 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.11.002

zbMATH Keywords

surfacedualitytree-width

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (3)

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Hypermap-homology quantum codes

Cites Work

• Unnamed Item
• Graph minors. III. Planar tree-width
• Treewidth lower bounds with brambles
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• S-functions for graphs
• Graph searching and a min-max theorem for tree-width
• Chordal embeddings of planar graphs
• Graph minors. XV: Giant steps
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Tree-width of graphs and surface duality

This page was built for publication: Tree-width of hypergraphs and surface duality