Recommendations
Cites work
- scientific article; zbMATH DE number 1157214 (Why is no real title available?)
- scientific article; zbMATH DE number 2228553 (Why is no real title available?)
- Asymptotic number of isometric generalized Fibonacci cubes
- Fast recognition of Fibonacci cubes
- Generalized Fibonacci cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Linear recognition and embedding of Fibonacci cubes
- On median nature and enumerative properties of Fibonacci-like cubes
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- Proofs of two conjectures on generalized Fibonacci cubes
- Recursive fault-tolerance of Fibonacci cube in hypercubes
- Solution to a conjecture on words that are bad and 2-isometric
- Structure of Fibonacci cubes: a survey
- The degree sequence of Fibonacci and Lucas cubes
- The index of a binary word
- The observability of the Fibonacci and the Lucas cubes
Cited in
(17)- Circular embeddability of isometric words
- Words that almost commute
- Density of \(k\)-ary words with 0, 1, 2-error overlaps
- Isometric words based on swap and mismatch distance
- Isometric words and edit distance: main notions and new variations
- Hypercubes and isometric words based on swap and mismatch distance
- All good (bad) words consisting of four blocks.
- Infinite families of 2-isometric and not 3-isometric binary words
- The index of a binary word
- A negative answer to a problem on generalized Fibonacci cubes
- A characterization of non-isometric binary words
- Quaternary \(n\)-cubes and isometric words
- The self-concatenation of isometric strings is isometric
- On \(k\)-ary \(n\)-cubes and isometric words
- Checking whether a word is Hamming-isometric in linear time
- All good (bad) words consisting of 5 blocks
- Proof of a conjecture on 2-isometric words
This page was built for publication: The structures of bad words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326667)
