The carvingwidth of hypercubes

DOI10.1016/J.DISC.2006.04.012MaRDI QIDQ2509307zbMATH OpenOpenAlexFDO

Authors L. Sunil Chandran, Telikepalli Kavitha

Publication date 19 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

isoperimetric inequalities

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The carving-width of generalized hypercubes
• The treewidth and pathwidth of hypercubes
• Isoperimetric inequalities and the width parameters of graphs
• Characterizing graphs of small carving-width
• Characterizing Graphs of Small Carving-Width

Cites work

• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 18980 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• scientific article; zbMATH DE number 2080246 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• A note on the edges of the n-cube
• Automata, Languages and Programming
• Call routing and the ratcatcher
• Girth and treewidth
• On the bandwidth of a Hamming graph
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• The Mcfunction. [The Takagi function]
• The treewidth and pathwidth of hypercubes

Cited in

(10)

• Bounds on isoperimetric values of trees
• On spanning tree congestion of graphs
• The carving-width of generalized hypercubes
• The treewidth and pathwidth of hypercubes
• A New Property of Hamming Graphs and Mesh of d-ary Trees
• Characterizing graphs of small carving-width
• Isoperimetric inequalities and the width parameters of graphs
• Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
• Isoperimetric Problem and Meta-fibonacci Sequences
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis

This page was built for publication: The carvingwidth of hypercubes

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