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 2017Show all

2 papers · 1 filter

cs.DM2017

Vertex partitions of $(C_{3}, C_{4}, C_{6})$ -free planar graphs

François Dross, Pascal Ochem

A graph is $(k_{1}, k_{2})$ -colorable if its vertex set can be partitioned into a graph with maximum degree at most $k_{1}$ and and a graph with maximum degree at most $k_{2}$ . We show that…

cs.DM2017

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

François Dross, Mickael Montassier, Alexandre Pinlou

We prove that every triangle-free planar graph of order $n$ and size $m$ has an induced linear forest with at least $\frac{9 n - 2 m}{11}$ vertices, and thus at least $\frac{5n + 8}{…

Vertex partitions of (C3​,C4​,C6​)-free planar graphs

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

Vertex partitions of $(C_{3}, C_{4}, C_{6})$ -free planar graphs