Conceptio › Archive › arXiv (All)
arXiv (All) open access

Constructing two completely independent spanning trees in dual-cubes

Lalou, Mohammed et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
combinatoricsg-2-2
In this paper, we prove the existence of two completely independent spanning trees in the $n$-dimensional dual-cube $F_n$, a variant of the hypercube, for every $n \geq 5$. To this end, we use the hypercube structure of the clusters of $F_n$ to extend the construction of CIST from the $(n-1)$-dimens
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1049935
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive