Upper bounds on the length of circuits of even spread in the d-cube

DOI10.1016/S0021-9800(69)80013-XMaRDI QIDQ5576809zbMATH OpenFDO

Authors Robert James Douglas

Publication date 1969

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(69)80013-X

zbMATH Keywords

topology

Cited in

(5)

• On the snake in the box problem
• Isomorphism of maximum length circuit codes
• Snakes, coils, and single-track circuit codes with spread \(k\)
• An upper bound on the size of the snake-in-the-box
• A new upper bound for the length of snakes

This page was built for publication: Upper bounds on the length of circuits of even spread in the d-cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576809)