9 citations · 9 across the 3 of their papers we have counts for
3 papers
math.CO2024
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
Stijn Cambie, François Dross, Kolja Knauer +2
A question at the intersection of Barnette's Hamiltonicity and Neumann-Lara's dicoloring conjecture is: Can every Eulerian oriented planar graph be vertex-partitioned into two acyc…
math.CO2023★ 9 cited
Separating the edges of a graph by a linear number of paths
Marthe Bonamy, Fábio Botler, François Dross +2
Recently, Letzter proved that any graph of order contains a collection of paths with the following property: for all distinct edges and …
cs.DM2021
On the proper interval completion problem within some chordal subclasses
François Dross, Claire Hilaire, Ivo Koch +4
Given a property (graph class) , a graph , and an integer , the \emph{-completion} problem consists in deciding whether we can turn into a graph with the property $…