On the treewidth of toroidal grids

DOI10.1016/J.DAM.2015.06.027zbMATH Open1327.05091OpenAlexW783839863MaRDI QIDQ897618FDOQ897618

Authors: Masashi Kiyomi, Yoshio Okamoto, 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

Recommendations

• Treewidth and gonality of glued grid graphs
• Parameters tied to treewidth
• Lower bounds on the pathwidth of some grid-like graphs
• Treewidth lower bounds with brambles
• Computational aspects of treewidth for graph

zbMATH Keywords

treewidthtoroidal gridbramble

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cites Work

• Graph searching and a min-max theorem for tree-width
• A partial k-arboretum of graphs with bounded treewidth
• Quickly excluding a planar graph
• Graph minors. II. Algorithmic aspects of tree-width
• The vertex separation number of a graph equals its path-width
• Title not available (Why is that?)
• Lower bounds on the pathwidth of some grid-like graphs
• The carving-width of generalized hypercubes
• Achievable sets, brambles, and sparse treewidth obstructions
• Treewidth of Cartesian Products of Highly Connected Graphs
• Lower bounds for treewidth of product graphs

Cited In (3)

• On resource placements in 3D tori.
• Lower bounds on the pathwidth of some grid-like graphs
• Title not available (Why is that?)

This page was built for publication: On the treewidth of toroidal grids

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