2 citations · 4 across the 6 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
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 and size has an induced linear forest with at least vertices, and thus at least $\frac{5n + 8}{…
cs.DM2016
Partitioning sparse graphs into an independent set and a forest of bounded degree
François Dross, Mickael Montassier, Alexandre Pinlou
An -partition of a graph is a partition of the vertices of the graph into two sets and , such that is an independent set and induces a forest…
cs.DM2015★ 1 cited
A lower bound on the order of the largest induced forest in planar graphs with high girth
François Dross, Mickael Montassier, Alexandre Pinlou
We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth and size $m…