On constructing snakes in powers of complete graphs

DOI10.1016/S0012-365X(97)00039-3MaRDI QIDQ1381860zbMATH OpenFDO

Authors Jerzy Wojciechowski

Publication date 7 September 1998

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

snakechordless cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Further results on snakes in powers of complete graphs
• Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices
• Snakes and pseudo-snakes in powers of complete graphs

Cites work

• scientific article; zbMATH DE number 36687 (Why is no real title available?)
• scientific article; zbMATH DE number 1792645 (Why is no real title available?)
• A Method for Constructing Circuit Codes
• A new lower bound for snake-in-the-box codes
• Covering the hypercube with a bounded number of disjoint snakes
• Further results on snakes in powers of complete graphs
• Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices
• Maximal length of circuit in a unitary \(n\)-dimensional cube
• On the snake in the box problem
• Snakes and pseudo-snakes in powers of complete graphs
• Snakes in Powers of Complete Graphs
• The snake-in-the-box problem: A new upper bound

Cited in

(3)

• scientific article; zbMATH DE number 2086231 (Why is no real title available?)
• ON THE LENGTH OF SNAKES IN POWERS OF COMPLETE GRAPHS
• Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices

This page was built for publication: On constructing snakes in powers of complete graphs

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