The vertex leafage of chordal graphs

Finally, we prove that every chordal graph G admits a tree model that realizes both the leafage and the vertex leafage of G. Notably, for every path graph G, there exists a path model with ℓ(G) leaves in the host tree and we describe an O(n3) time algorithm to compute such a path model.