Julien de Carufel

collaborators

2 papers

math.CO2017

Leaf realization problem, caterpillar graphs and prefix normal words

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$ , let $L_{G} (i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with…

cs.DS2017

Fully leafed induced subtrees

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \leq n$ vertices and $ℓ$ leaves in $G$ …