On the Lettericity of Paths

preprint2020arXivOpen access

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$ .

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract