Minimal change list for Lucas strings and some graph theoretic consequences

DOI10.1016/j.tcs.2005.08.020zbMath1081.68065OpenAlexW2129872841MaRDI QIDQ2581343

Jean-Luc Baril, Vicentiu Vajnovszki

Publication date: 10 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.020

zbMATH Keywords

Hamiltonian pathGray codeLucas cubeFibonacci and Lucas stringMinimal change list

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Gray codes for Fibonacci \(q\)-decreasing words ⋮ More restrictive Gray codes for necklaces and Lyndon words ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Hamilton paths in dominating graphs of trees and cycles

Cites Work

• The observability of the Fibonacci and the Lucas cubes
• Generating Linear Extensions Fast
• Generalized fibonacci cubes are mostly hamiltonian
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal change list for Lucas strings and some graph theoretic consequences