Comments on F. Hadlock's Paper: ``Finding a Maximum Cut of a Planar Graph in Polynomial Time''.

K. Aoshima Masao Iri Comments on F. Hadlock's Paper: ``Finding a Maximum Cut of a Planar Graph in Polynomial Time''. 86-87 1977 6 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp6.html#AoshimaI77