
FPT algorithms for packing ksafe spanning rooted sub(di)graphs
We study three problems introduced by BangJensen and Yeo [Theor. Comput...
read it

Complementary cycles of any length in regular bipartite tournaments
Let D be a kregular bipartite tournament on n vertices. We show that, f...
read it

Nonseparating spanning trees and outbranchings in digraphsof independence number 2
A subgraph H= (V, F) of a graph G= (V,E) is nonseparating if GF, that ...
read it

Width Parameterizations for Knotfree Vertex Deletion on Digraphs
A knot in a directed graph G is a strongly connected subgraph Q of G wit...
read it

The structure of graphs with given number of blocks and the maximum Wiener index
The Wiener index (the distance) of a connected graph is the sum of dista...
read it

Graphs with the second and third maximum Wiener index over the 2vertex connected graphs
Wiener index, defined as the sum of distances between all unordered pair...
read it

(Arcdisjoint) cycle packing in tournament: classical and parameterized complexity
Given a tournament T, the problem MaxCT consists of finding a maximum (a...
read it

Dynamic monopolies for interval graphs with bounded thresholds
For a graph G and an integervalued threshold function τ on its vertex s...
read it

Degreeconstrained 2partitions of graphs
A (δ≥ k_1,δ≥ k_2)partition of a graph G is a vertexpartition (V_1,V_2)...
read it
Stéphane Bessy
is this you? claim profile