The treewidth of 2-section of hypergraphs
From MaRDI portal
Publication:5024663
DOI10.46298/dmtcs.6499zbMath1481.05114arXiv2005.04556OpenAlexW4205490446MaRDI QIDQ5024663
Publication date: 27 January 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.04556
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The treewidth of line graphs
- Graph minors. III. Planar tree-width
- S-functions for graphs
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Tree-width, path-width, and cutwidth
- On tree width, bramble size, and expansion
- Nonserial dynamic programming
- Parameters Tied to Treewidth
- The cutwidth of a graph and the vertex separation number of the line graph
- Treewidth of the Line Graph of a Complete Graph
This page was built for publication: The treewidth of 2-section of hypergraphs