Yun Wang

collaborators

2 papers

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)$ ,…

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…