On 3-regular bipancyclic subgraphs of hypercubes (Q499820)

Summary: The \(n\)-dimensional hypercube \(Q_n\) is bipancyclic; that is, it contains a cycle of every even length from 4 to \(2^n\). In this paper, we prove that \(Q_n\) \((n\geq 3)\) contains a 3-regular, 3-connected, bipancyclic subgraph with \(l\) vertices for every even \(l\) from 8 to \(2^n\) except 10.