Manuel Lafond

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete

Max DuprÃ© la Tour, Manuel Lafond, NdiamÃ© Ndiaye

Leaf powers and pairwise compatibility graphs were introduced over twenty years ago as simplified graph models for phylogenetic trees. Despite significant research, several propert…

math.CO2024

$k$ -Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$

A graph $G = (V, E)$ is a $k$ -leaf power if there is a tree $T$ whose leaves are the vertices of $G$ with the property that a pair of leaves $u$ and $v$ induce an edge in $G$ if and o…

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete

k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k≥5

$k$ -Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$