THEOREM OF THE DAY Wagner’s Theorem A graph G is planar if and only if it contains neither K5 nor K3,3 as a graph minor. The graph above left is the famous Petersen graph. Its nonplanarity can be confirmed by Kuratowsk - Forbidden - Document - PDFSEARCH.IO

First Page	Meta Content
	THEOREM OF THE DAY Wagner’s Theorem A graph G is planar if and only if it contains neither K5 nor K3,3 as a graph minor. The graph above left is the famous Petersen graph. Its nonplanarity can be confirmed by Kuratowsk Add to Reading List Document Date: 2014-02-07 05:07:17 Open Document File Size: 153,17 KB Share Result on Facebook

UPDATE

THEOREM OF THE DAY Wagner’s Theorem A graph G is planar if and only if it contains neither K5 nor K3,3 as a graph minor. The graph above left is the famous Petersen graph. Its nonplanarity can be confirmed by KuratowskAdd to Reading List