Treewidth of Cartesian Products of Highly Connected Graphs

DOI10.1002/jgt.21677zbMath1269.05093arXiv1105.1586OpenAlexW1691925402MaRDI QIDQ5325943

David R. Wood

Publication date: 31 July 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.1586

zbMATH Keywords

treewidthCartesian product

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Treewidth of the generalized Kneser graphs ⋮ On the treewidth of toroidal grids ⋮ Treewidth of the \(q\)-Kneser graphs ⋮ Lower bounds for treewidth of product graphs

Cites Work

• Clique minors in Cartesian products of graphs
• Bandwidth and pathwidth of three-dimensional grids
• The treewidth and pathwidth of hypercubes
• Treewidth lower bounds with brambles
• On the bandwidth of 3-dimensional Hamming graphs
• A note on graph minors and strong products
• Treewidth and logical definability of graph products
• Graph minors. V. Excluding a planar graph
• Optimal labelling of a product of two paths
• A partial k-arboretum of graphs with bounded treewidth
• Graph searching and a min-max theorem for tree-width
• On the bandwidth of a Hamming graph
• Bandwidth of the Cartesian product of two connected graphs
• Optimal Indexing of the Vertices of Graphs
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Treewidth of Cartesian Products of Highly Connected Graphs