Finding a maximum cut of a planar graph in polynomial time (1975)

by F Hadlock
Venue:SIAM J. Comput