This web page lists papers citing my paper:

"A Note on Bipartite Subgraphs of Triangle-free Graphs", RC 17106, Random Structures and Algorithms, 3(1992), p.223-226.

- N. V. Ngoc and Z. Tuza, "Linear-Time Approximation Algorithms for the Max Cut Problem", Combinatorics, Probability and Computing, 2(1993), p. 201-210.
- S. Poljak and Z. Tuza, "Bipartite Subgraphs of Triangle-Free Graphs", Siam Journal on Discrete Mathematics, 7(1994), p. 307-313.
- N. Alon, "Bipartite Subgraphs", Combinatorica, 16(1996), p. 301-311.
- S. Bylka, A. Idzik and Z. Tuza, "Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdos inequality", Discrete Mathematics, 194(1999), p. 39-58.

[ IBM home page | Order | Search | Contact IBM | Legal ]