On the construction of tree decompositions of hypercubes

MaRDI QIDQ2948819zbMATH OpenFDO

Authors Negin Karisani, E. S. Mahmoodian

Publication date 6 October 2015

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

Mathematics Subject Classification ID

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

Abstract: There are different concepts regarding to tree decomposition of a graph $G$. For the Hypercube $Q_n$, these concepts have been shown to have many applications. But some diverse papers on this subject make it difficult to follow what is precisely known. In this note first we will mention some known results on the tree decomposition of hypercubes and then introduce new explicit constructions for the previously known and unknown cases.

Recommendations

• On the decomposition of n‐cubes into isomorphic trees
• The treewidth and pathwidth of hypercubes
• scientific article; zbMATH DE number 15360
• scientific article; zbMATH DE number 867627
• scientific article; zbMATH DE number 1026076

Cited in

(3)

• Long path and cycle decompositions of even hypercubes
• On the decomposition of n‐cubes into isomorphic trees
• What do trees and hypercubes have in common?

This page was built for publication: On the construction of tree decompositions of hypercubes

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