Proof of a conjecture on 2-isometric words
From MaRDI portal
Publication:2220880
Recommendations
Cites work
- A characterization of non-isometric binary words
- A negative answer to a problem on generalized Fibonacci cubes
- All good (bad) words consisting of 5 blocks
- All good (bad) words consisting of four blocks.
- Asymptotic number of isometric generalized Fibonacci cubes
- Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes
- Generalized Fibonacci cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Infinite families of 2-isometric and not 3-isometric binary words
- On isomorphism classes of generalized Fibonacci cubes
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- Parity index of binary words and powers of prime words
- Proofs of two conjectures on generalized Fibonacci cubes
- Solution to a conjecture on words that are bad and 2-isometric
- Structure of Fibonacci cubes: a survey
- The index of a binary word
- The self-concatenation of isometric strings is isometric
- The structures of bad words
Cited in
(9)- On \(k\)-ary \(n\)-cubes and isometric words
- Infinite families of 2-isometric and not 3-isometric binary words
- A characterization of non-isometric binary words
- Solution to a conjecture on words that are bad and 2-isometric
- Hypercubes and isometric words based on swap and mismatch distance
- Partial cubes and Fibonacci dimension: insights and perspectives
- Isometric sets of words and generalizations of the Fibonacci cubes
- A family of partial cubes with minimal Fibonacci dimension
- Transformations between minimally f-free words
This page was built for publication: Proof of a conjecture on 2-isometric words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220880)