Wenan Zang

According to our database, Wenan Zang authored at least 63 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

On Gupta's Codensity Conjecture.

Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang

SIAM J. Discret. Math., September, 2023

2020

Ranking tournaments with no errors II: Minimax relation.

Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao

J. Comb. Theory, Ser. B, 2020

Ranking tournaments with no errors I: Structural description.

Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao

J. Comb. Theory, Ser. B, 2020

2019

Densities, Matchings, and Fractional Edge-Colorings.

Xujin Chen, Wenan Zang, Qiulan Zhao

SIAM J. Optim., 2019

2018

When Is the Matching Polytope Box-Totally Dual Integral?

Guoli Ding, Lei Tan, Wenan Zang

Math. Oper. Res., 2018

On box-perfect graphs.

Guoli Ding, Wenan Zang, Qiulan Zhao

J. Comb. Theory, Ser. B, 2018

2016

A Polyhedral Description of Kernels.

Qin Chen, Xujin Chen, Wenan Zang

Math. Oper. Res., 2016

2015

Coloring digraphs with forbidden cycles.

Zhibin Chen, Jie Ma, Wenan Zang

J. Comb. Theory, Ser. B, 2015

2014

Nowhere-Zero 3-Flows in Signed Graphs.

Yezhou Wu, Dong Ye, Wenan Zang, Cun-Quan Zhang

SIAM J. Discret. Math., 2014

2013

An Optimal Binding Number Condition for Bipancyclism.

Zhiquan Hu, Ka Ho Law, Wenan Zang

SIAM J. Discret. Math., 2013

Approximate min-max relations on plane graphs.

Jie Ma, Xingxing Yu, Wenan Zang

J. Comb. Optim., 2013

2012

The Maximum-Weight Stable Matching Problem: Duality and Efficiency.

Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang

SIAM J. Discret. Math., 2012

Total Dual Integrality in Some Facility Location Problems.

Xujin Chen, Zhibin Chen, Wenan Zang

SIAM J. Discret. Math., 2012

The circumference of a graph with no K_{3, t}-minor, II.

Guantao Chen, Xingxing Yu, Wenan Zang

J. Comb. Theory, Ser. B, 2012

Bonds with parity constraints.

Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang

J. Comb. Theory, Ser. B, 2012

2011

Approximating the chromatic index of multigraphs.

Guantao Chen, Xingxing Yu, Wenan Zang

J. Comb. Optim., 2011

2010

A Unified Approach to Box-Mengerian Hypergraphs.

Xujin Chen, Zhibin Chen, Wenan Zang

Math. Oper. Res., 2010

2009

A Characterization of Almost CIS Graphs.

Yezhou Wu, Wenan Zang, Cun-Quan Zhang

SIAM J. Discret. Math., 2009

Packing circuits in matroids.

Guoli Ding, Wenan Zang

Math. Program., 2009

Odd-K₄'s in stability critical graphs.

Zhibin Chen, Wenan Zang

Discret. Math., 2009

Preface.

Guantao Chen, Xingxing Yu, Wenan Zang

Discret. Math., 2009

The box-TDI system associated with 2-edge connected spanning subgraphs.

Xujin Chen, Guoli Ding, Wenan Zang

Discret. Appl. Math., 2009

2008

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows.

Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang

SIAM J. Discret. Math., 2008

The complexity of recognizing linear systems with certain integrality properties.

Guoli Ding, Li Feng, Wenan Zang

Math. Program., 2008

A Characterization of Box-Mengerian Matroid Ports.

Xujin Chen, Guoli Ding, Wenan Zang

Math. Oper. Res., 2008

2007

A Min-Max Theorem on Tournaments.

Xujin Chen, Xiaodong Hu, Wenan Zang

SIAM J. Comput., 2007

2006

Differential Methods for Finding Independent Sets in Hypergraphs.

Yusheng Li, Wenan Zang

SIAM J. Discret. Math., 2006

Approximating Longest Cycles in Graphs with Bounded Degrees.

Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang

SIAM J. Comput., 2006

A Min-Max Relation on Packing Feedback Vertex Sets.

Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang

Math. Oper. Res., 2006

The circumference of a graph with no K_{3, t}-minor.

Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang

J. Comb. Theory, Ser. B, 2006

An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.

Xujin Chen, Wenan Zang

Algorithmica, 2006

2005

Hamilton paths in toroidal graphs.

Robin Thomas, Xingxing Yu, Wenan Zang

J. Comb. Theory, Ser. B, 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, Ser. B, 2005

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.

Xueliang Li, Wenan Zang

J. Comb. Optim., 2005

Perfect Circular Arc Coloring.

Xujin Chen, Zhiquan Hu, Wenan Zang

J. Comb. Optim., 2005

Ramsey functions involving <i>K</i>_{<i>m</i>, <i>n</i>} with <i>n</i> large.

Yusheng Li, Xueqing Tang, Wenan Zang

Discret. Math., 2005

Approximating the Longest Cycle Problem on Graphs with Bounded Degree.

Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

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, Ser. B, 2004

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time.

Bo Chen, Xiaotie Deng, Wenan Zang

J. Comb. Optim., 2004

f-Factors in bipartite (mf)-graphs.

Guizhen Liu, Wenan Zang

Discret. Appl. Math., 2004

Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares.

Rong Luo, Wenan Zang, Cun-Quan Zhang

Comb., 2004

An upper bound for ramsey numbers.

Yusheng Li, Cecil C. Rousseau, Wenan Zang

Appl. Math. Lett., 2004

2003

Ramsey numbers involving large dense graphs and bipartite Turán numbers.

Yusheng Li, Wenan Zang

J. Comb. Theory, Ser. B, 2003

Packing cycles in graphs, II.

Guoli Ding, Zhenzhen Xu, Wenan Zang

J. Comb. Theory, Ser. B, 2003

The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers.

Yusheng Li, Wenan Zang

J. Comb. Optim., 2003

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

2002

A Min-Max Theorem on Feedback Vertex Sets.

Mao-cheng Cai, Xiaotie Deng, Wenan Zang

Math. Oper. Res., 2002

Packing Cycles in Graphs.

Guoli Ding, Wenan Zang

J. Comb. Theory, Ser. B, 2002

Group testing and fault detection for replicated files.

Frank K. Hwang, Wenan Zang

Discret. Appl. Math., 2002

2001

Asymptotic Upper Bounds for Ramsey Functions.

Yusheng Li, Cecil C. Rousseau, Wenan Zang

Graphs Comb., 2001

2000

An Approximation Algorithm for Feedback Vertex Sets in Tournaments.

Mao-cheng Cai, Xiaotie Deng, Wenan Zang

SIAM J. Comput., 2000

Wavelength allocation on trees of rings.

Xiaotie Deng, Guojun Li, Wenan Zang

Networks, 2000

Totally balanced combinatorial optimization games.

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang

Math. Program., 2000

Solution to a problem on degree sequences of graphs.

Mao-cheng Cai, Xiaotie Deng, Wenan Zang

Discret. Math., 2000

A 2-Approximation Algorithm for Path Coloring on Trees of Rings.

Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers.

Wenan Zang

Discret. Math., 1999

1998

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable.

Wenan Zang

J. Comb. Optim., 1998

Coloring graphs with no odd-K₄.

Wenan Zang

Discret. Math., 1998

A TDI System and its Application to Approximation Algorithms.

Mao-cheng Cai, Xiaotie Deng, Wenan Zang

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K₄ Is 3-Colorable.

Wenan Zang

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Detecting Corrupted Pages in <i>M</i> Replicated Large Files.

Frank K. Hwang, Wenan Zang

IEEE Trans. Parallel Distributed Syst., 1997

1995

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs.

Wenan Zang

Discret. Math., 1995

1991

The maximum number of diagonals of a cycle in a block and its extremal graphs.

Feng Tian, Wenan Zang

Discret. Math., 1991