J. Bang-Jensen

activity

20112024

most citedFinding an induced subdivision of a digraph

11 citations · 32 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DM2017★ 2 cited

Bipartite spanning sub(di)graphs induced by 2-partitions

Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1

For a given $2$ -partition $(V_{1}, V_{2})$ of the vertices of a (di)graph $G$ , we study properties of the spanning bipartite subdigraph $B_{G} (V_{1}, V_{2})$ of $G$ induced by those arcs/edges…

cs.DM2017

Out-degree reducing partitions of digraphs

Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1

Let $k$ be a fixed integer. We determine the complexity of finding a $p$ -partition $(V_{1}, \dots, V_{p})$ of the vertex set of a given digraph such that the maximum out-degree of each…

cs.DM2017★ 1 cited

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…