×

zbMATH — the first resource for mathematics

Dross, François

Compute Distance To:
Author ID: dross.francois Recent zbMATH articles by "Dross, François"
Published as: Dross, François
Documents Indexed: 20 Publications since 2016

Publications by Year

Citations contained in zbMATH Open

8 Publications have been cited 37 times in 37 Documents Cited by Year
Colouring diamond-free graphs. Zbl 1372.05067
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
9
2017
Fractional triangle decompositions in graphs with large minimum degree. Zbl 1329.05244
Dross, François
9
2016
A lower bound on the order of the largest induced forest in planar graphs with high girth. Zbl 1346.05039
Dross, François; Montassier, Mickael; Pinlou, Alexandre
6
2016
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1369.05169
Dross, François; Montassier, Mickael; Pinlou, Alexandre
4
2017
Colouring diamond-free graphs. Zbl 1378.68070
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
4
2016
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 06562477
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
3
2016
The structure of graphs with given number of blocks and the maximum Wiener index. Zbl 1434.05042
Bessy, Stéphane; Dross, François; Hriňáková, Katarína; Knor, Martin; Škrekovski, Riste
1
2020
Partitioning sparse graphs into an independent set and a forest of bounded degree. Zbl 1391.05091
Dross, François; Montassier, Mickael; Pinlou, Alexandre
1
2018
The structure of graphs with given number of blocks and the maximum Wiener index. Zbl 1434.05042
Bessy, Stéphane; Dross, François; Hriňáková, Katarína; Knor, Martin; Škrekovski, Riste
1
2020
Partitioning sparse graphs into an independent set and a forest of bounded degree. Zbl 1391.05091
Dross, François; Montassier, Mickael; Pinlou, Alexandre
1
2018
Colouring diamond-free graphs. Zbl 1372.05067
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
9
2017
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Zbl 1369.05169
Dross, François; Montassier, Mickael; Pinlou, Alexandre
4
2017
Fractional triangle decompositions in graphs with large minimum degree. Zbl 1329.05244
Dross, François
9
2016
A lower bound on the order of the largest induced forest in planar graphs with high girth. Zbl 1346.05039
Dross, François; Montassier, Mickael; Pinlou, Alexandre
6
2016
Colouring diamond-free graphs. Zbl 1378.68070
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël
4
2016
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 06562477
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
3
2016

Citations by Year