A note on the cubical dimension of new classes of binary trees /
The cubical dimension of a graph G is the smallest dimension of a hypercube into which G is embeddable as a subgraph. The conjecture of Havel (1984) claims that the cubical dimension of every balanced binary tree with 2^{n} vertices, n \geqslant 1, is n. The 2-rooted complete binary tree of depth n...
| Hlavní autor: |
Kabyl, Kamal
(
Autor )
|
|---|---|
| Další autoři: |
Berrachedi, Abdelhafid
(
Autor )
|
| Typ dokumentu: | Článek |
| Jazyk: |
angličtina |
| ISSN: | 0011-4642 |
| Zdroj: | Czechoslovak mathematical journal: Roč. 65, č.1 (2015), s. 151-160. |
| Předmět: | |
| Externí odkaz: |
http://dx.doi.org/10.1007/s10587-015-0165-6
|