Report - Short proofs of coloring theorems on planar graphs · CASE1 G contains a4-face (try3-color G) v 3 v 2 v 0 v 1 x 1 x 2 CASE2 G contains no4-faces. Every planar triangle-free graph

Please pass captcha verification before submit form