The carving-width of generalized hypercubes

DOI10.1016/j.disc.2010.06.039zbMath1222.05041OpenAlexW2072495696MaRDI QIDQ710586

Koichi Yamazaki, Kyohei Kozawa, Yota Otachi

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.039

zbMATH Keywords

hypercubeHamming graphtorusgridcarving-width

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (3)

On the treewidth of toroidal grids ⋮ Fractal dimension and lower bounds for geometric problems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The treewidth and pathwidth of hypercubes
• The rank-width of the square grid
• Computing rank-width exactly
• A spectral lower bound for the treewidth of a graph and its consequences
• Graph minors. X: Obstructions to tree-decomposition
• Edge-isoperimetric inequalities in the grid
• A partial k-arboretum of graphs with bounded treewidth
• Call routing and the ratcatcher
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• On the bandwidth of a Hamming graph
• An edge-isoperimetric problem for powers of the Petersen graph
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• Edge isoperimetric theorems for integer point arrays
• The carvingwidth of hypercubes
• Assignment of Numbers to Vertices
• Optimal branch-decomposition of planar graphs in O ( n ³ ) Time
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices
• LINEAR LAYOUT OF GENERALIZED HYPERCUBES

This page was built for publication: The carving-width of generalized hypercubes