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

by F O Hadlock
Venue:SIAM Journal on Computing