Prove that for every planar graph $G$ there exists an integer $k$ such that $G$ is isomorphic to a minor of the $k \times k$ grid.
Posted: Dec 03 '12
Seen: 65 times
Last updated: Dec 03 '12
Number of edges in a quasi-planar graph
Characterizing outerplanar graphs
Coloring Hamiltonian plane graph