Palindromic Ziv-Lempel and Crochemore Factorizations of $m$-Bonacci Infinite Words

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.