Pages that link to "Item:Q4376203"

The following pages link to A Survey of Combinatorial Gray Codes (Q4376203):

Displaying 50 items.

• Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
• Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes (Q343754) (← links)
• 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)
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
• Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
• Generalized Gray codes with prescribed ends (Q512653) (← links)
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← 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)
• Gray codes for signed involutions (Q724881) (← links)
• On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
• Long paths and cycles in hypercubes with faulty vertices (Q730940) (← links)
• Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
• Gray coding cubic planar maps (Q906395) (← 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)
• Extending perfect matchings to Gray codes with prescribed ends (Q1648667) (← links)
• Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
• Recoloring graphs via tree decompositions (Q1686264) (← links)
• Trimming and gluing Gray codes (Q1694730) (← 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)
• On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
• Gray codes and symmetric chains (Q2072179) (← links)
• Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)