11 citations · 32 across the 21 of their papers we have counts for
6 papers · 1 filter
Digraphs and variable degeneracy
Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz
Let be a digraph, let be an integer, and let be a vector function with . We say that has an -partition if…
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
J. Bang-Jensen, F. Havet, M. Kriesell +1
Generalizing well-known results of Erdős and Lovász, we show that every graph contains a spanning -partite subgraph with , wher…
Component Order Connectivity in Directed Graphs
J. Bang-Jensen, E. Eiben, G. Gutin +2
A directed graph is semicomplete if for every pair of vertices of there is at least one arc between and \viol{Thus, a tournament is a semicomplete digraph.}…
Supereulerian 2-edge-coloured graphs
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
A 2-edge-coloured graph is {\bf supereulerian} if contains a spanning closed trail in which the edges alternate in colours. An {\bf eulerian factor} of a 2-edge-coloured gr…
On the parameterized complexity of 2-partitions
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
We give an FPT algorithm for deciding whether the vertex set a digraph can be partitioned into two disjoint sets such that the digraph induced by has a…
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2
Joergen Bang-Jensen, Stephane Bessy, Frederic Havet +1
We prove that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching and an in-branching which are arc-disjoint (we call su…