The max-cut problem on graphs not contractible to K5
- 1 August 1983
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (3) , 107-111
- https://doi.org/10.1016/0167-6377(83)90016-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- On Tutte's extension of the four-colour problemJournal of Combinatorial Theory, Series B, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Beweis einer Abschwächung der Hadwiger-VermutungMathematische Annalen, 1964