Recognizing k -Leaf Powers in Polynomial Time, for Constant k

Parameterized Leaf Power Recognition via Embedding into Graph Products

(2020) David Eppstein et al.   ALGORITHMICA

Mim-width III. Graph powers and generalized distance domination problems

(2019) Lars Jaffke et al.   THEORETICAL COMPUTER SCIENCE

Towards a Characterization of Leaf Powers by Clique Arrangements

(2016) Ragnar Nevries et al.   GRAPHS AND COMBINATORICS

Pairwise Compatibility Graphs: A Survey

(2016) Tiziana Calamoneri et al.   SIAM REVIEW

Resolving Difficult Phylogenetic Questions: Why More Sequences Are Not Enough

(2011) Hervé Philippe et al.   PLOS BIOLOGY

Rooted directed path graphs are leaf powers

(2009) Andreas Brandstädt et al.   DISCRETE MATHEMATICS

Structure and linear-time recognition of 4-leaf powers

(2008) Andreas Brandstädt et al.   ACM Transactions on Algorithms

The NLC-width and clique-width for powers of graphs of bounded tree-width

(2008) Frank Gurski et al.   DISCRETE APPLIED MATHEMATICS

A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers

(2008) Andreas Brandstädt et al.   DISCRETE MATHEMATICS