home AS/A2 d1 AS/A2

D1 Topic 2: Algorithms on graphs
Planarity backmore

 View full screen  


Summary
A graph is planar if it can be drawn in a plane in such a way that no two edges meet each other except at a vertex to which they are both incident.
Flash powered - you will need the Flash 5 plugin This page uses Macromedia Flash. Your browser will need to have the Flash plugin installed - freely available from Macromedia.