6 citations · 24 across the 32 of their papers we have counts for
4 papers · 2 filters
Bipartite spanning sub(di)graphs induced by 2-partitions
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1
For a given -partition of the vertices of a (di)graph , we study properties of the spanning bipartite subdigraph of induced by those arcs/edges…
Out-degree reducing partitions of digraphs
Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1
Let be a fixed integer. We determine the complexity of finding a -partition of the vertex set of a given digraph such that the maximum out-degree of each…
Out-colourings of Digraphs
Noga Alon, Joergen Bang-Jensen, Stéphane Bessy
We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an {\bf out-colouring}. The problem of deciding whether a given digra…
The Geodetic Hull Number is Hard for Chordal Graphs
Stéphane Bessy, Mitre C. Dourado, Lucia D. Penso +1
We show the hardness of the geodetic hull number for chordal graphs.