The carving-width of generalized hypercubes
From MaRDI portal
Publication:710586
DOI10.1016/J.DISC.2010.06.039zbMATH Open1222.05041OpenAlexW2072495696MaRDI QIDQ710586FDOQ710586
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
Distance in graphs (05C12) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- A partial k-arboretum of graphs with bounded treewidth
- Call routing and the ratcatcher
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- Optimal Assignments of Numbers to Vertices
- Optimal numberings and isoperimetric problems on graphs
- Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
- Edge-isoperimetric inequalities in the grid
- Title not available (Why is that?)
- An edge-isoperimetric problem for powers of the Petersen graph
- A spectral lower bound for the treewidth of a graph and its consequences
- Assignment of Numbers to Vertices
- Edge-isoperimetric problems for Cartesian powers of regular graphs
- The treewidth and pathwidth of hypercubes
- Title not available (Why is that?)
- General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
- Computing rank-width exactly
- On the bandwidth of a Hamming graph
- Edge isoperimetric theorems for integer point arrays
- The carvingwidth of hypercubes
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
- The rank-width of the square grid
Cited In (3)
Recommendations
This page was built for publication: The carving-width of generalized hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710586)
