Wenan Zang

collaborators

4 papers

cs.DM2026

How Difficult Is It to Recognize CIS Graphs?

Rongchuan Tao, Mengxi Yang, Wenan Zang

A graph $G$ is called $C I S$ if each maximal clique intersects each maximal stable set of $G$ , with maximality taken with respect to set inclusion. CIS graphs resemble perfect graph…

math.CO2026

Tournament Ranking: Duality and Efficiency

Ge Song, Mengxi Yang, Wenan Zang

The feedback arc set problem on tournaments arises in a rich variety of applications, and has been studied extensively in several research fields over the past six decades. It is w…

math.CO2024

Integral Biflow Maximization

Guoli Ding, Rongchuan Tao, Mengxi Yang +1

Let $G = (V, E)$ be a graph with four distinguished vertices, two sources $s_{1}, s_{2}$ and two sinks $t_{1}, t_{2}$ , let $c : E \to Z_{+}$ be a capacity function, and let ${\c…

math.CO2024

A short proof of the Goldberg-Seymour conjecture

Guantao Chen, Yanli Hao, Xingxing Yu +1

For a multigraph $G$ , $I ¨ ^{'} (G)$ denotes the chromatic index of $G$ , $I^ (G)$ the maximum degree of $G$ , and $Î(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \…