The following pages link to Wenan Zang (Q186288):
Displaying 50 items.
- Approximate min-max relations on plane graphs (Q358640) (← links)
- Bonds with parity constraints (Q414634) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor (Q859611) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)
- The maximum number of diagonals of a cycle in a block and its extremal graphs (Q1176736) (← links)
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable (Q1273432) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- \(f\)-factors in bipartite (\(mf\))-graphs (Q1421483) (← links)
- Solution to a problem on degree sequences of graphs (Q1567678) (← links)
- Totally balanced combinatorial optimization games (Q1575068) (← links)
- Coloring graphs with no \(\text{odd-}K_4\) (Q1584207) (← links)
- The lower bound on independence number. (Q1609723) (← links)
- On box-perfect graphs (Q1682206) (← links)
- An upper bound for Ramsey numbers. (Q1764577) (← links)
- The independence number of graphs with a forbidden cycle and Ramsey numbers (Q1768585) (← links)
- On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601) (← links)
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs (Q1897443) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Hamilton paths in toroidal graphs (Q2485945) (← links)
- An efficient algorithm for finding maximum cycle packings in reducible flow graphs (Q2492638) (← links)
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares (Q2567403) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- Ramsey functions involving \(K_{m,n}\) with \(n\) large (Q2570109) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- An approximation algorithm for feedback vertex sets in tournaments (Q2719120) (← links)
- Bounds of Ramsey functions and asymptotic methods (Q2767413) (← links)
- An optimal binding number condition for bipancyclism (Q2848523) (← links)
- Nowhere-Zero 3-Flows in Signed Graphs (Q2935292) (← links)
- A Characterization of Box-Mengerian Matroid Ports (Q3168979) (← links)
- A Unified Approach to Box-Mengerian Hypergraphs (Q3169112) (← links)
- A Polyhedral Description of Kernels (Q3186539) (← links)
- Approximating Longest Cycles in Graphs with Bounded Degrees (Q3446811) (← links)
- A Min-Max Theorem on Tournaments (Q3507526) (← links)
- A Characterization of Almost CIS Graphs (Q3563939) (← links)
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows (Q3629459) (← links)
- (Q3974704) (← links)
- A new sufficient condition for \(S\)-circuits in graphs (Q3974710) (← links)
- (Q4218428) (← links)
- (Q4263703) (← links)
