Sciweavers

TALG
2008
67views more  TALG 2008»
14 years 13 days ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan