For every n ≥ 5, the n-dimensional dual-cube contains two completely independent spanning trees; for n ≥ 6 the paper gives a recursive construction with diameter bounds 5n+5 and 5n+7.
Title resolution pending
1 Pith paper cite this work, alongside 12 external citations. Polarity classification is still indexing.
1
Pith paper citing it
12
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Constructing two completely independent spanning trees in the dual-cube
For every n ≥ 5, the n-dimensional dual-cube contains two completely independent spanning trees; for n ≥ 6 the paper gives a recursive construction with diameter bounds 5n+5 and 5n+7.