A note on the cubical dimension of new classes of binary trees

K Kabyl, A Berrachedi, É Sopena - Czechoslovak Mathematical Journal, 2015 - Springer
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 …
被引用次数：4 相关文章

A note on the cubical dimension of new classes of binary trees

K Kabyl, A Berrachedi, É Sopena - Czechoslovak Mathematical Journal, 2015 - dml.cz
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 …

A note on the cubical dimension of new classes of binary trees

K Kabyl, A Berrachedi, É Sopena - Czechoslovak Mathematical Journal, 2015 - infona.pl
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 …

A note on the cubical dimension of new classes of binary trees

K Kabyl, A Berrachedi, E Sopena - Czechoslovak Mathematical Journal, 2014 - hal.science
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 [On hamiltonian circuits and spanning …

A note on the cubical dimension of new classes of binary trees

K Kabyl, A Berrachedi, É Sopena - Czechoslovak Mathematical Journal, 2015 - eudml.org
Abstract top 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 …