6 citations · 24 across the 32 of their papers we have counts for
4 papers · 1 filter
Constrained Flows in Networks
Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
The support of a flow in a network is the subdigraph induced by the arcs for which . We discuss a number of results on flows in networks where we put certain rest…
Dichromatic number of chordal graphs
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
The dichromatic number of a digraph is the minimum integer such that it admits a -dicolouring, i.e. a partition of its vertices into acyclic subdigraphs. We say that a d…
Sparse vertex cutsets and the maximum degree
Stéphane Bessy, Johannes Rauch, Dieter Rautenbach +1
We show that every graph of maximum degree and sufficiently large order has a vertex cutset of order at most that induces a subgraph of maximum degree at mos…
Temporalizing digraphs via linear-size balanced bi-trees
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
In a directed graph on vertex set , a \emph{forward arc} is an arc where . A pair is \emph{forward connected} if there is a directed pat…