The treewidth and pathwidth of hypercubes
From MaRDI portal
Publication:819827
DOI10.1016/j.disc.2005.12.011zbMath1083.05034OpenAlexW2094909623MaRDI QIDQ819827
L. Sunil Chandran, Telikepalli Kavitha
Publication date: 29 March 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.011
Related Items (20)
Decontamination of hypercubes by mobile agents ⋮ Treewidth of Cartesian Products of Highly Connected Graphs ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ Grid minors in damaged grids ⋮ Graph classes with and without powers of bounded clique-width ⋮ A lower bound for the vertex boundary-width of complete \(k\)-ary trees ⋮ Treewidth is a lower bound on graph gonality ⋮ Fast Searching on Cartesian Products of Graphs ⋮ The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ The fast search number of a Cartesian product of graphs ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ The carving-width of generalized hypercubes ⋮ The carvingwidth of hypercubes ⋮ Beating treewidth for average-case subgraph isomorphism ⋮ Bounds on isoperimetric values of trees ⋮ On the width of regular classes of finite structures ⋮ Tight Bounds on the Descriptional Complexity of Regular Expressions ⋮ On spanning tree congestion of graphs ⋮ Synthesizing structured reactive programs via deterministic tree automata
Cites Work
- Graph minors. I. Excluding a forest
- A short proof for a theorem of Harper about Hamming-spheres
- A partial k-arboretum of graphs with bounded treewidth
- On an isoperimetric problem for Hamming graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Optimal numberings and isoperimetric problems on graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The treewidth and pathwidth of hypercubes
