6 citations · 24 across the 32 of their papers we have counts for
4 papers · 1 filter
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro +2
A knot in a directed graph is a strongly connected subgraph of with at least two vertices, such that no vertex in is an in-neighbor of a vertex in $V(G)\setminus…
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…
Good orientations of 2T-graphs
J. Bang-Jensen, S. Bessy, J. Huang +1
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus…