Alexandre Pinlou

activity

20112026

most citedThe Domination Number of Grids

115 citations · 191 across the 17 of their papers we have counts for

collaborators

Showing 2016Show all

3 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…

math.CO2016★ 13 cited

On the difference between the Szeged and Wiener index

Marthe Bonamy, Martin Knor, Borut Lužar +2

We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if $G$ is a 2-connected non-complete graph…

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…