Border correlations, lattices, and the subgraph component polynomial
From MaRDI portal
Publication:1678101
DOI10.1016/j.ejc.2017.07.017zbMath1373.05002MaRDI QIDQ1678101
Michelle Cordier, Francine Blanchet-Sadri, Rachel Kirsch
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.017
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity algorithms and a conjecture on overlaps in partial words
- An algorithmic toolbox for periodic partial words
- Indeterminate strings, prefix arrays \& undirected graphs
- Counting bordered partial words by critical positions
- The enumeration of vertex induced subgraphs with respect to the number of components
- Border correlation of binary words
- A new approach to the periodicity lemma on strings with holes
- Combinatorics on partial word correlations
- Border correlations of partial words
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Unbordered partial words
- Periods in strings
- Partial words and a theorem of Fine and Wilf
- Combinatorics of periods in strings.
- Local periods and binary partial words: an algorithm
- Periods in partial words: an algorithm
- Squares and primitivity in partial words
- Border Correlations, Lattices, and the Subgraph Component Polynomial
- Kuratowski's theorem
- Algorithms on Strings, Trees and Sequences
- Partial words and the interaction property of periods
- Algorithmic Combinatorics on Partial Words
- Algorithms on Strings
- Partial words and a theorem of Fine and Wilf revisited
