Planarity Algorithm (Edexcel A-Level Further Mathematics): Flashcards

A graph drawable on a plane without edges crossing

Cycle visiting every vertex exactly once, returning to start

Contains subgraph homeomorphic to $K_5$ or $K_{3,3}$

Complete graph on 5 vertices

Complete bipartite graph with two sets of 3 vertices

$v - e + f = 2$

Number of vertices

Number of edges

Number of faces (including outer face)

10 edges