Combinatorial families that are exponentially far from being listable in Gray code sequence

DOI10.1090/S0002-9947-99-02229-1zbMath0918.05107OpenAlexW1636676699MaRDI QIDQ4216327

Ted Chinburg, Carla D. Savage, Herbert S. Wilf

Publication date: 26 October 1998

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-99-02229-1

zbMATH Keywords

nonexistenceNP-completeexistence problemGray codeHamiltonian path problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Algebraic combinatorics (05E99) Polynomials in number theory (11C08) Trigonometric and exponential sums (general theory) (11L03) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• String overlaps, pattern matching, and nontransitive games
• Gray codes for \(A\)-free strings
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Updating the hamiltonian problem—A survey
• A Survey of Combinatorial Gray Codes

This page was built for publication: Combinatorial families that are exponentially far from being listable in Gray code sequence