On the treewidth of toroidal grids
From MaRDI portal
Publication:897618
DOI10.1016/j.dam.2015.06.027zbMath1327.05091OpenAlexW783839863MaRDI QIDQ897618
Yoshio Okamoto, Masashi Kiyomi, Yota Otachi
Publication date: 7 December 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.027
Related Items
Cites Work
- Unnamed Item
- The carving-width of generalized hypercubes
- Lower bounds for treewidth of product graphs
- Achievable sets, brambles, and sparse treewidth obstructions
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- Quickly excluding a planar graph
- Lower bounds on the pathwidth of some grid-like graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Treewidth of Cartesian Products of Highly Connected Graphs