Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Updating the hamiltonian problem—A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: String overlaps, pattern matching, and nontransitive games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Survey of Combinatorial Gray Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gray codes for \(A\)-free strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3470467 / rank | |||
Normal rank |
Revision as of 17:04, 28 May 2024
scientific article; zbMATH DE number 1214880
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial families that are exponentially far from being listable in Gray code sequence |
scientific article; zbMATH DE number 1214880 |
Statements
Combinatorial families that are exponentially far from being listable in Gray code sequence (English)
0 references
26 October 1998
0 references
Gray code
0 references
nonexistence
0 references
existence problem
0 references
Hamiltonian path problem
0 references
NP-complete
0 references