Tree-width of hypergraphs and surface duality

DOI10.1016/J.JCTB.2011.11.002zbMATH Open1241.05102OpenAlexW1986576219MaRDI QIDQ414640FDOQ414640

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

Recommendations

• Tree-width of graphs and surface duality
• Chordal embeddings of planar graphs
• Pathwidth of planar and line graphs
• On self duality of pathwidth in polyhedral graph embeddings
• On the path-width of planar graphs

zbMATH Keywords

surfacedualitytree-width

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Pathwidth of planar and line graphs
• On self-duality of branchwidth in graphs of bounded genus
• Hypermap-homology quantum codes
• Coloring face hypergraphs on surfaces
• Chordal embeddings of planar graphs
• Bounding tree-width via contraction on the projective plane and torus
• The treewidth of 2-section of hypergraphs
• Tree-width of graphs and surface duality
• A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
• Branchwidth is \((1, g)\)-self-dual

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

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