Wenan Zang

From MaRDI portal
Person:186288

Available identifiers

zbMath Open zang.wenanWikidataQ102386096 ScholiaQ102386096MaRDI QIDQ186288

List of research outcomes





PublicationDate of PublicationType
Packing Feedback Arc Sets in Tournaments Exactly2024-03-05Paper
On Gupta’s Codensity Conjecture2023-08-11Paper
Ranking tournaments with no errors. II: Minimax relation2020-04-07Paper
Ranking tournaments with no errors. I: Structural description2020-01-15Paper
Densities, matchings, and fractional edge-colorings2019-02-08Paper
Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs2019-01-29Paper
On box-perfect graphs2017-11-28Paper
A Polyhedral Description of Kernels2016-08-10Paper
Coloring digraphs with forbidden cycles2015-08-21Paper
Nowhere-zero 3-flows in signed graphs2014-12-22Paper
An optimal binding number condition for bipancyclism2013-09-26Paper
Approximate min-max relations on plane graphs2013-08-09Paper
The circumference of a graph with no \(K_{3,t}\)-minor. II2013-01-14Paper
The Maximum-Weight Stable Matching Problem: Duality and Efficiency2013-01-04Paper
Total dual integrality in some facility location problems2013-01-04Paper
Bonds with parity constraints2012-05-11Paper
A Characterization of Box-Mengerian Matroid Ports2011-04-27Paper
A unified approach to box-Mengerian hypergraphs2011-04-27Paper
Approximating the chromatic index of multigraphs2011-03-17Paper
A characterization of almost CIS graphs2010-06-01Paper
Odd-\(K_{4}\)'s in stability critical graphs2009-12-15Paper
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows2009-05-27Paper
Packing circuits in matroids2009-04-24Paper
The box-TDI system associated with 2-edge connected spanning subgraphs2009-03-04Paper
A Min-Max Theorem on Tournaments2008-06-19Paper
The complexity of recognizing linear systems with certain integrality properties2008-06-04Paper
A Min-Max Relation on Packing Feedback Vertex Sets2008-05-27Paper
Approximating Longest Cycles in Graphs with Bounded Degrees2007-06-26Paper
The circumference of a graph with no \(K_{3,t}\)-minor2007-01-16Paper
Algorithms and Computation2006-11-14Paper
An efficient algorithm for finding maximum cycle packings in reducible flow graphs2006-06-14Paper
Differential Methods for Finding Independent Sets in Hypergraphs2006-06-01Paper
Computing and Combinatorics2006-01-11Paper
Algorithms and Computation2005-12-22Paper
A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs2005-12-14Paper
A Min-Max Theorem on Feedback Vertex Sets2005-11-11Paper
Ramsey functions involving \(K_{m,n}\) with \(n\) large2005-10-26Paper
Perfect circular arc coloring2005-10-18Paper
Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares2005-10-04Paper
Hamilton paths in toroidal graphs2005-08-05Paper
On-line scheduling a batch processing system to minimize total weighted job completion time2005-03-15Paper
The independence number of graphs with a forbidden cycle and Ramsey numbers2005-03-15Paper
An upper bound for Ramsey numbers.2005-02-25Paper
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44741042004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44633672004-05-27Paper
\(f\)-factors in bipartite (\(mf\))-graphs2004-01-26Paper
Packing cycles in graphs. II2003-08-25Paper
Ramsey numbers involving large dense graphs and bipartite Turán numbers2003-08-25Paper
Packing cycles in graphs2003-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45457202002-11-11Paper
Group testing and fault detection for replicated files2002-09-29Paper
The lower bound on independence number.2002-08-15Paper
Asymptotic upper bounds for Ramsey functions2002-02-17Paper
Bounds of Ramsey functions and asymptotic methods2002-01-29Paper
Wavelength allocation on trees of rings2001-10-14Paper
An approximation algorithm for feedback vertex sets in tournaments2001-06-21Paper
Totally balanced combinatorial optimization games2001-06-10Paper
Solution to a problem on degree sequences of graphs2000-12-13Paper
Coloring graphs with no \(\text{odd-}K_4\)2000-11-02Paper
Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42637031999-11-21Paper
Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42184281999-02-14Paper
Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs1996-02-12Paper
https://portal.mardi4nfdi.de/entity/Q39747041992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39747101992-06-25Paper
The maximum number of diagonals of a cycle in a block and its extremal graphs1992-06-25Paper

Research outcomes over time

This page was built for person: Wenan Zang