摘要：For a non-negative integer ð", a graph G is an ð"-leaf power of a tree T if V(G) is equal to the set of leaves of T, and distinct vertices v and w of G are adjacent if and only if the distance between v and w in T is at most ð". Given a graph G, 3-Leaf Power Deletion asks whether there is a set S âS V(G) of size at most k such that G\S is a 3-leaf power of some treeT. We provide a polynomial kernel for this problem. More specifically, we present a polynomial-time algorithm for an input instance (G,k) to output an equivalent instance (G',k') such that k'⤠k and G' has at most O(k^14) vertices.
