Anders Yeo

activity

20242026

collaborators

4 papers

math.CO2026

Acyclic orientations of mixed graphs

Jørgen Bang-Jensen, Anders Yeo

A mixed graph $M = (V, E \cup A)$ is acyclic if its directed part $(V, A)$ is an acyclic digraph. In this note we study the so-called orientation completion problem for the class of acy…

math.CO2025

Acyclic dichromatic number of oriented graphs

Jørgen Bang-Jensen, Lucas Picasarri-Arrieta, Anders Yeo

The dichromatic number $χ (D)$ of a digraph $D = (V, A)$ is the minimum number of sets in a partition $V_{1}, \dots, V_{k}$ of $V$ into $k$ subsets so that the induced subdigraph $D[V…

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

Generalized paths and cycles in semicomplete multipartite digraphs

Jørgen Bang-Jensen, Yun Wang, Anders Yeo

It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D = (V, A)$ ,…