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 math.COShow all

4 papers · 1 filter

math.CO2020

Tree pivot-minors and linear rank-width

Konrad K. Dabrowski, François Dross, Jisu Jeong +4

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree~ $T$ , the class…

math.CO2019★ 2 cited

Jones' Conjecture in subcubic graphs

Marthe Bonamy, François Dross, Tomáš Masařík +3

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain $k + 1$ vertex-disjoint cycles, then it suffices to delete $2 k$ vertices to obta…

math.CO2018★ 2 cited

Note on 3-Choosability of Planar Graphs with Maximum Degree 4

François Dross, Borut Lužar, Mária Maceková +1

Deciding whether a planar graph (even of maximum degree $4$ ) is $3$ -colorable is NP-complete. Determining subclasses of planar graphs being $3$ -colorable has a long history, but si…

math.CO2015★ 2 cited

Fractional triangle decompositions in graphs with large minimum degree

François Dross

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of…