11 citations · 32 across the 21 of their papers we have counts for
10 papers · 1 filter
Proper-walk connection number of graphs
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
This paper studies the problem of proper-walk connection number: given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there e…
Spanning eulerian subdigraphs in semicomplete digraphs
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeeo
A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltoni…
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions
Joergen Bang-Jensen, Gregory Gutin, Anders Yeo
A strong arc decomposition of a digraph is a decomposition of its arc set into two disjoint subsets and such that both of the spanning subdigraphs $D_1=(V…
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…