8 citations · 20 across the 14 of their papers we have counts for
5 papers · 1 filter
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 vertex-disjoint cycles, then it suffices to delete vertices to obta…
Complexity of planar signed graph homomorphisms to cycles
François Dross, Florent Foucaud, Valia Mitsou +2
We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs…
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs
Stéphane Bessy, François Dross, Martin Knor +1
Wiener index, defined as the sum of distances between all unordered pairs of vertices, is one of the most popular molecular descriptors. It is well known that among 2-vertex connec…
The structure of graphs with given number of blocks and the maximum Wiener index
Stéphane Bessy, François Dross, Katarína Hriňáková +2
The Wiener index (the distance) of a connected graph is the sum of distances between all pairs of vertices. In this paper, we study the maximum possible value of this invariant amo…
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi, François Dross, Pascal Ochem
We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these…