Short dominating paths and cycles in the binary hypercube
DOI10.1007/PL00001292zbMath0989.05080MaRDI QIDQ5939208
Simon N. Litsyn, Iiro S. Honkala, Uri Blass, Mark G. Karpovsky
Publication date: 14 July 2002
Published in: Annals of Combinatorics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (2)
This page was built for publication: Short dominating paths and cycles in the binary hypercube