Wenan Zang

activity

20142026

most citedProof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs

12 citations · 12 across the 7 of their papers we have counts for

collaborators

8 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$ , $χ^{'} (G)$ denotes the chromatic index of $G$ , $Δ (G)$ the maximum degree of $G$ , and $Γ(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \sub…

math.CO2019

On Gupta's Co-density Conjecture

Yan Cao, Guantao Chen, Guoli Ding +2

Let $G = (V, E)$ be a multigraph. The {\em cover index} $ξ (G)$ of $G$ is the greatest integer $k$ for which there is a coloring of $E$ with $k$ colors such that each vertex of $G$ is…

math.CO2019★ 12 cited

Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs

Guantao Chen, Guangming Jing, Wenan Zang

Given a multigraph $G = (V, E)$ , the {\em edge-coloring problem} (ECP) is to color the edges of $G$ with the minimum number of colors so that no two adjacent edges have the same color…

math.CO2016

On Box-Perfect Graphs

Guoli Ding, Wenan Zang, Qiulan Zhao

Let $G = (V, E)$ be a graph and let $A_{G}$ be the clique-vertex incidence matrix of $G$ . It is well known that $G$ is perfect iff the system $A_{_{G}} x \leq 1$ , $\mathbf x\…

math.CO2014

Coloring Digraphs with Forbidden Cycles

Zhibin Chen, Jie Ma, Wenan Zang

Let $k$ and $r$ be two integers with $k \geq 2$ and $k \geq r \geq 1$ . In this paper we show that (1) if a strongly connected digraph $D$ contains no directed cycle of length $1$ modul…