Pages that link to "Item:Q4376203"
From MaRDI portal
The following pages link to A Survey of Combinatorial Gray Codes (Q4376203):
Displayed 50 items.
- Synthetic sequence design for signal location search (Q378252) (← links)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges (Q394540) (← links)
- The Takagi function: a survey (Q418203) (← links)
- Gray codes with bounded weights (Q442379) (← links)
- Distribution of the sum-of-digits function of random integers: a survey (Q462807) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- Reordering columns for smaller indexes (Q545370) (← links)
- Description of polygonal regions by polynomials of bounded degree (Q621777) (← links)
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Long paths and cycles in hypercubes with faulty vertices (Q730940) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- Path bundles on \(n\)-cubes (Q932673) (← links)
- Flips in planar graphs (Q950400) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- Gray codes for reflectable languages (Q976101) (← links)
- Optimal electronic musical instruments (Q976499) (← links)
- Disjoint Hamilton cycles in the star graph (Q990094) (← links)
- Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
- Maximum number of edges joining vertices on a cube (Q1014401) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes (Q1024489) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Matching graphs of hypercubes and complete bipartite graphs (Q1039435) (← links)
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups (Q1403878) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- On a characterization of the standard Gray code by using the edge type on a hypercube (Q1847379) (← links)
- A heuristic approach for constructing symmetric Gray codes (Q1883151) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Token graphs (Q1926040) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- Efficient generation of restricted growth words (Q2444851) (← links)
- Integer representations towards efficient counting in the bit probe model (Q2447536) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Cyclic sequences of \(k\)-subsets with distinct consecutive unions (Q2468032) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems (Q3092335) (← links)
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- On combinatorial Gray codes with distance 3 (Q3225885) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Matching graphs of Hypercubes and Complete Bipartite Graphs (Q3503492) (← links)
- Generating all distributions of objects to bins (Q3615543) (← links)
- Hamiltonian threshold for strong products of graphs (Q3630836) (← links)
- Finding Lean Induced Cycles in Binary Hypercubes (Q3637155) (← links)
- Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327) (← links)