J. Bang-Jensen

activity

20192025

collaborators

5 papers

math.CO2025

Vertex-partitions of 2-edge-colored graphs

Jørgen Bang-Jensen, Francois Pirot, Anders Yeo

A {\bf $k$ -majority coloring} of a digraph $D = (V, A)$ is a coloring of $V$ with $k$ colors so that each vertex $v \in V$ has at least as many out-neighbours of color differe…

math.CO2024

On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs

Jørgen Bang-Jensen, Jing Huang

A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$ , the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$ …

math.CO2023

Strong arc decompositions of split digraphs

Joergen Bang-Jensen, Yun Wang

A {\bf strong arc decomposition} of a digraph $D = (V, A)$ is a partition of its arc set $A$ into two sets $A_{1}, A_{2}$ such that the digraph $D_{i} = (V, A_{i})$ is strong for $i = 1, 2$ . Bang-Je…

cs.DM2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2

Joergen Bang-Jensen, Stéphane Bessy, Anders Yeo

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that is, the graph obtained from G by deleting the edges in F, is connected. Analogously we say that a subdigraph…

math.CO2019

Good orientations of 2T-graphs

J. Bang-Jensen, S. Bessy, J. Huang +1

In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus…