1 citations · 1 across the 7 of their papers we have counts for
12 papers
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
François Dross, Krzysztof Fleszar, Karol Węgrzycki +1
In this paper, we study problems of connecting classes of points via noncrossing structures. Given a set of colored terminal points, we want to find a graph for each color that con…
1-planar graphs with minimum degree at least 3 have bounded girth
François Dross
We show that every 1-planar graph with minimum degree at least 4 has girth at most , and every 1-planar graph with minimum degree at least 3 has girth at most .
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…