Maximal length of circuit in a unitary \(n\)-dimensional cube
From MaRDI portal
Publication:2546193
DOI10.1007/BF01119684zbMath0216.55802MaRDI QIDQ2546193
Publication date: 1970
Published in: Mathematical Notes (Search for Journal in Brave)
Linear codes (general theory) (94B05) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)
Related Items (4)
On the Complexity of Minimizing Quasicyclic Boolean Functions ⋮ On constructing snakes in powers of complete graphs ⋮ Minimal enumerations of subsets of a finite set and the middle level problem ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube
Cites Work
This page was built for publication: Maximal length of circuit in a unitary \(n\)-dimensional cube
