Manuel Lafond, Recognizing k-leaf powers in polynomial time, for constant k
Zoom ID: 869 4632 6610 (ibsdimag)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 …
Loading view.