论文标题
关于路径的字母
On the Lettericity of Paths
论文作者
论文摘要
验证Petkov {Š} ec的猜想，我们证明了N-Vertex路径的字母精确是$ \ left \ lfloor \ frac \ frac {n+4} {3} {3} \ right \ right \ rfloor $。
Verifying a conjecture of Petkov{š}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.
