Covering the hypercube with a bounded number of disjoint snakes

DOI10.1007/BF01302970zbMath0816.05047MaRDI QIDQ1343173

Jerzy Wojciechowski

Publication date: 1 February 1995

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

snakespanned subgraphErdős' problemsnake-in-the-boxspanned cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)

Related Items (3)

On constructing snakes in powers of complete graphs ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ Unnamed Item

Cites Work

• Unnamed Item
• On the snake in the box problem
• A new lower bound for snake-in-the-box codes

This page was built for publication: Covering the hypercube with a bounded number of disjoint snakes