Author:
Currie James,Lafrance Philip
Abstract
For every pattern $p$ over the alphabet $\{x,x^R,y, y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献