On some weakly bipartite graphs

Authors:
Francisco Barahona
Affiliations:
Institut für Operations Research, Universität Bonn, Fed. Rep. Germany
Venue:
Operations Research Letters
Year:
1983

Citing 3
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Weakly bipartite graphs and the Max-cut problem

Operations Research Letters
The max-cut problem on graphs not contractible to K5

Operations Research Letters

Optimal cuts in graphs and statistical mechanics

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize a class of weakly bipartite graphs. In this case, the max-cut problem can be solved by finding a minimum two-commodity cut.