Finding a Maximum Cut of a Planar Graph in Polynomial Time
- 1 September 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (3) , 221-225
- https://doi.org/10.1137/0204019
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Eulerian Walks in GraphsSIAM Journal on Computing, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965