Gray codes with bounded weights

DOI10.1016/J.DISC.2011.09.034zbMATH Open1246.05094OpenAlexW2125921594MaRDI QIDQ442379FDOQ442379

Authors: Tomáš Dvořák, Jiří Fink, 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

Recommendations

• scientific article; zbMATH DE number 5761830
• Combinatorial families that are exponentially far from being listable in Gray code sequence
• Generalized Gray codes with prescribed ends
• Gray codes and overlap cycles for restricted weight words
• Transition restricted Gray codes

zbMATH Keywords

hypercubeHamiltonian cycleHamiltonian pathNP-hardpolynomial algorithmgray codefaulty vertex

Mathematics Subject Classification ID

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

Cites Work

• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• A Survey of Combinatorial Gray Codes
• The edge Hamiltonian path problem is NP-complete
• Embedded paths and cycles in faulty hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Long cycles in hypercubes with distant faulty vertices
• Hamiltonian index is NP-complete
• Computational complexity of long paths and cycles in faulty hypercubes

Cited In (7)

• Long cycles in hypercubes with optimal number of faulty vertices
• Index system and separability of constant weight Gray codes
• Title not available (Why is that?)
• Binary Gray codes with long bit runs
• Near optimal single-track Gray codes
• Trimming and gluing Gray codes
• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES

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

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