Which of these is the condition for a planar graph (Kuratoski's Theorem)?
It does not contain K5K_5K5 or K3,3K_{3,3}K3,3 as minors
It must be a tree
It must have at least one cycle
It must be complete