The maximum number of diagonals of a cycle in a block and its extremal graphs. - Feng Tian; Wenan Zang (Discret. Math., 1991)

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. - Wenan Zang (Discret. Math., 1995)

Detecting Corrupted Pages in M Replicated Large Files. - Frank K. Hwang; Wenan Zang (IEEE Trans. Parallel Distributed Syst., 1997)

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. - Wenan Zang (COCOON, 1998)

A TDI System and its Application to Approximation Algorithms. - Mao-cheng Cai; Xiaotie Deng; Wenan Zang (FOCS, 1998)

Coloring graphs with no odd-K4. - Wenan Zang (Discret. Math., 1998)

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. - Wenan Zang (J. Comb. Optim., 1998)

Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. - Wenan Zang (Discret. Math., 1999)

A 2-Approximation Algorithm for Path Coloring on Trees of Rings. - Xiaotie Deng; Yi Zhou; Guojun Li; Wenan Zang (ISAAC, 2000)

Solution to a problem on degree sequences of graphs. - Mao-cheng Cai; Xiaotie Deng; Wenan Zang (Discret. Math., 2000)

Totally balanced combinatorial optimization games. - Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi; Wenan Zang (Math. Program., 2000)

Wavelength allocation on trees of rings. - Xiaotie Deng; Guojun Li; Wenan Zang (Networks, 2000)

An Approximation Algorithm for Feedback Vertex Sets in Tournaments. - Mao-cheng Cai; Xiaotie Deng; Wenan Zang (SIAM J. Comput., 2000)

Asymptotic Upper Bounds for Ramsey Functions. - Yusheng Li 001; Cecil C. Rousseau; Wenan Zang (Graphs Comb., 2001)

Group testing and fault detection for replicated files. - Frank K. Hwang; Wenan Zang (Discret. Appl. Math., 2002)

Packing Cycles in Graphs. - Guoli Ding; Wenan Zang (J. Comb. Theory B, 2002)

A Min-Max Theorem on Feedback Vertex Sets. - Mao-cheng Cai; Xiaotie Deng; Wenan Zang (Math. Oper. Res., 2002)

A 2-approximation algorithm for path coloring on a restricted class of trees of rings. - Xiaotie Deng; Guojun Li; Wenan Zang; Yi Zhou (J. Algorithms, 2003)

The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. - Yusheng Li 001; Wenan Zang (J. Comb. Optim., 2003)

Packing cycles in graphs, II. - Guoli Ding; Zhenzhen Xu; Wenan Zang (J. Comb. Theory B, 2003)

Ramsey numbers involving large dense graphs and bipartite Turán numbers. - Yusheng Li 001; Wenan Zang (J. Comb. Theory B, 2003)

An upper bound for ramsey numbers. - Yusheng Li 001; Cecil C. Rousseau; Wenan Zang (Appl. Math. Lett., 2004)

Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. - Rong Luo; Wenan Zang; Cun-Quan Zhang (Comb., 2004)

f-Factors in bipartite (mf)-graphs. - Guizhen Liu; Wenan Zang (Discret. Appl. Math., 2004)

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. - Bo Chen 002; Xiaotie Deng; Wenan Zang (J. Comb. Optim., 2004)

Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. - Xiaotie Deng; Guojun Li; Wenan Zang (J. Comb. Theory B, 2004)

Approximating the Longest Cycle Problem on Graphs with Bounded Degree. - Guantao Chen; Zhicheng Gao; Xingxing Yu; Wenan Zang (COCOON, 2005)

Ramsey functions involving Km, n with n large. - Yusheng Li 001; Xueqing Tang; Wenan Zang (Discret. Math., 2005)

Perfect Circular Arc Coloring. - Xujin Chen; Zhiquan Hu; Wenan Zang (J. Comb. Optim., 2005)

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. - Xueliang Li 001; Wenan Zang (J. Comb. Optim., 2005)

Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325]. - Xiaotie Deng; Guojun Li; Wenan Zang (J. Comb. Theory B, 2005)

Hamilton paths in toroidal graphs. - Robin Thomas 001; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2005)

An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. - Xujin Chen; Wenan Zang (Algorithmica, 2006)

The circumference of a graph with no K3, t-minor. - Guantao Chen; Laura Sheppardson; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2006)

A Min-Max Relation on Packing Feedback Vertex Sets. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (Math. Oper. Res., 2006)

Approximating Longest Cycles in Graphs with Bounded Degrees. - Guantao Chen; Zhicheng Gao; Xingxing Yu; Wenan Zang (SIAM J. Comput., 2006)

Differential Methods for Finding Independent Sets in Hypergraphs. - Yusheng Li 001; Wenan Zang (SIAM J. Discret. Math., 2006)

A Min-Max Theorem on Tournaments. - Xujin Chen; Xiaodong Hu 001; Wenan Zang (SIAM J. Comput., 2007)

A Characterization of Box-Mengerian Matroid Ports. - Xujin Chen; Guoli Ding; Wenan Zang (Math. Oper. Res., 2008)

The complexity of recognizing linear systems with certain integrality properties. - Guoli Ding; Li Feng 001; Wenan Zang (Math. Program., 2008)

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. - Rong Luo; Rui Xu 023; Wenan Zang; Cun-Quan Zhang (SIAM J. Discret. Math., 2008)

The box-TDI system associated with 2-edge connected spanning subgraphs. - Xujin Chen; Guoli Ding; Wenan Zang (Discret. Appl. Math., 2009)

Preface. - Guantao Chen; Xingxing Yu; Wenan Zang (Discret. Math., 2009)

Odd-K4's in stability critical graphs. - Zhibin Chen; Wenan Zang (Discret. Math., 2009)

Packing circuits in matroids. - Guoli Ding; Wenan Zang (Math. Program., 2009)

A Characterization of Almost CIS Graphs. - Yezhou Wu; Wenan Zang; Cun-Quan Zhang (SIAM J. Discret. Math., 2009)

A Unified Approach to Box-Mengerian Hypergraphs. - Xujin Chen; Zhibin Chen; Wenan Zang (Math. Oper. Res., 2010)

Approximating the chromatic index of multigraphs. - Guantao Chen; Xingxing Yu; Wenan Zang (J. Comb. Optim., 2011)

Bonds with parity constraints. - Xujin Chen; Guoli Ding; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

The circumference of a graph with no K3, t-minor, II. - Guantao Chen; Xingxing Yu; Wenan Zang (J. Comb. Theory B, 2012)

Total Dual Integrality in Some Facility Location Problems. - Xujin Chen; Zhibin Chen; Wenan Zang (SIAM J. Discret. Math., 2012)

The Maximum-Weight Stable Matching Problem: Duality and Efficiency. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (SIAM J. Discret. Math., 2012)

Approximate min-max relations on plane graphs. - Jie Ma 002; Xingxing Yu; Wenan Zang (J. Comb. Optim., 2013)

An Optimal Binding Number Condition for Bipancyclism. - Zhiquan Hu; Ka Ho Law; Wenan Zang (SIAM J. Discret. Math., 2013)

Nowhere-Zero 3-Flows in Signed Graphs. - Yezhou Wu; Dong Ye 002; Wenan Zang; Cun-Quan Zhang (SIAM J. Discret. Math., 2014)

Coloring digraphs with forbidden cycles. - Zhibin Chen; Jie Ma 002; Wenan Zang (J. Comb. Theory B, 2015)

A Polyhedral Description of Kernels. - Qin Chen; Xujin Chen; Wenan Zang (Math. Oper. Res., 2016)

On box-perfect graphs. - Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2018)

When Is the Matching Polytope Box-Totally Dual Integral? - Guoli Ding; Lei Tan; Wenan Zang (Math. Oper. Res., 2018)

Densities, Matchings, and Fractional Edge-Colorings. - Xujin Chen; Wenan Zang; Qiulan Zhao (SIAM J. Optim., 2019)

Ranking tournaments with no errors I: Structural description. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

Ranking tournaments with no errors II: Minimax relation. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (J. Comb. Theory B, 2020)

On Gupta's Codensity Conjecture. - Yan Cao 001; Guantao Chen; Guoli Ding; Guangming Jing; Wenan Zang (SIAM J. Discret. Math., 2023)

Packing Feedback Arc Sets in Tournaments Exactly. - Xujin Chen; Guoli Ding; Wenan Zang; Qiulan Zhao (Math. Oper. Res., 2024)