Generating a Cyclic 2-Gray Code for Lucas Words in Constant Amortized Time

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Annual Symposium on Combinatorial Pattern Matching

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.CPM.2025.22
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Greedy Gray Codes for some Restricted Classes of Binary Words

  2024cited by this paper
• Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words

  2024influential reference
• Polyominoes and graphs built from Fibonacci words

  2022cited by this paper
• Q-bonacci words and numbers

  2022cited by this paper
• Combinatorial Gray codes-an updated survey

  2022cited by this paper
• Flip-swap languages in binary reflected Gray code order

  2022cited by this paper
• Fibonacci and Lucas p-cubes

  2022cited by this paper
• Asymptotic bit frequency in Fibonacci words

  2021cited by this paper
• Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order

  2021cited by this paper
• Fibonacci-run graphs II: Degree sequences

  2020cited by this paper
• Gray codes for Fibonacci q-decreasing words

  2020cited by this paper
• Fibonacci-run graphs I: basic properties

  2020cited by this paper
• Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes

  2015cited by this paper
• Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles

  2014cited by this paper
• Asymptotic Properties of Fibonacci Cubes and Lucas Cubes

  2013cited by this paper
• Generalized Lucas cubes

  2012cited by this paper
• Gray Code Order for Lyndon Words

  2007cited by this paper
• Minimal change list for Lucas strings and some graph theoretic consequences

  2005cited by this paper
• Primes in Fibonacci n-step and Lucas n-step Sequences

  2005cited by this paper
• Combinatorial Enumeration

  2004cited by this paper
• A Loopless Generation of Bitstrings without p Consecutive Ones

  2001cited by this paper
• On the Lucas Cubes

  2001cited by this paper
• Combinatorial families that are exponentially far from being listable in Gray code sequence

  1999cited by this paper
• A Survey of Combinatorial Gray Codes

  1997cited by this paper
• Generalized fibonacci cubes are mostly hamiltonian

  1994cited by this paper
• Constructive combinatorics

  1986cited by this paper
• Direct Calculation of k-Generalized Fibonacci Numbers

  1967cited by this paper
• Fibonacci-Tribonacci

  1963cited by this paper
• Generalized Fibonacci Numbers and Associated Matrices

  1960cited by this paper

• No citing papers are available for this paper.