-
Manuel Lafond, Recognizing k-leaf powers in polynomial time, for constant k
Manuel Lafond, Recognizing k-leaf powers in polynomial time, for constant k
A graph G is a k-leaf power if there exists a tree T whose leaf set is V(G), and such that uv is an edge if and only if the distance between u and v in T is at most k. The graph classes of k-leaf powers have several applications in computational biology, but recognizing …