Manuel Lafond

activity

20212026

most citedOn Generalizations of Pairwise Compatibility Graphs

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DM2024

Galled Perfect Transfer Networks

Alitzel López Sánchez, Manuel Lafond

Predicting horizontal gene transfers often requires comparative sequence data, but recent work has shown that character-based approaches could also be useful for this task. Notably…

math.CO2024

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

Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye +1

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…

Galled Perfect Transfer Networks

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$