Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time". - K. Aoshima; Masao Iri (SIAM J. Comput., 1977)