Generating Linear Extensions Fast
SIAM Journal on Computing
Generalized Fibonacci cubes are mostly Hamiltonian
Journal of Graph Theory
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Combinatorial Algorithms: For Computers and Hard Calculators
Combinatorial Algorithms: For Computers and Hard Calculators
The observability of the Fibonacci and the Lucas cubes
Discrete Mathematics
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generating gray codes in o(1) worst-case time per word
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
More restrictive Gray codes for necklaces and Lyndon words
Information Processing Letters
Gray codes for non-crossing partitions and dissections of a convex polygon
Discrete Applied Mathematics
| Hi-index | 0.00 |
We give a minimal change list for the set of order p length-n Lucas strings, i.e., the set of length-n binary strings with no p consecutive 1's nor a 1l prefix and a 1m suffix with l+m ≥ p. The construction of this list proves also that the order p n-dimensional Lucas cube has a Hamiltonian path if and only if n is not a multiple of p + 1, and its second power always has a Hamiltonian path.