M. Montassier

activity

20102021

most citedEntropy compression method applied to graph colorings

37 citations · 50 across the 12 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DM2016

Partitioning sparse graphs into an independent set and a forest of bounded degree

François Dross, Mickael Montassier, Alexandre Pinlou

An $(I, F_{d})$ -partition of a graph is a partition of the vertices of the graph into two sets $I$ and $F$ , such that $I$ is an independent set and $F$ induces a forest…

cs.DM2016

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree

François Dross, Mickael Montassier, Alexandre Pinlou

An $(F, F_{d})$ -partition of a graph is a vertex-partition into two sets $F$ and $F_{d}$ such that the graph induced by $F$ is a forest and the one induced by $F_{d}$ is a f…