Gray codes with bounded weights

DOI10.1016/j.disc.2011.09.034zbMath1246.05094OpenAlexW2125921594MaRDI QIDQ442379

Jiří Fink, Tomáš Dvořák, Petr Gregor, Václav Koubek

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.034

zbMATH Keywords

hypercubeHamiltonian cycleNP-hardpolynomial algorithmHamiltonian pathgray codefaulty vertex

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Long cycles in hypercubes with optimal number of faulty vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian index is NP-complete
• Computational complexity of long paths and cycles in faulty hypercubes
• The edge Hamiltonian path problem is NP-complete
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• On Hamiltonian circuits and spanning trees of hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• A Survey of Combinatorial Gray Codes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Embedded paths and cycles in faulty hypercubes

This page was built for publication: Gray codes with bounded weights