François Dross

activity

20142022

most citedLarge induced forests in planar graphs with girth 4 or 5

8 citations · 20 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018

On the unavoidability of oriented trees

François Dross, Frédéric Havet

A digraph is {\it $n$ -unavoidable} if it is contained in every tournament of order $n$ . We first prove that every arborescence of order $n$ with $k$ leaves is $(n + k - 1)$ -unavoidable…

math.CO2018★ 2 cited

Note on 3-Choosability of Planar Graphs with Maximum Degree 4

François Dross, Borut Lužar, Mária Maceková +1

Deciding whether a planar graph (even of maximum degree $4$ ) is $3$ -colorable is NP-complete. Determining subclasses of planar graphs being $3$ -colorable has a long history, but si…