Completeness holds as, if the input graph G is planar, and if the prover constructs T and f correctly, as well as the path-outerplanar graph GT, ...
確定! 回上一頁