Graph Planarity Checker

K_5 and K_{3,3} free?

All Tools

Loading tool...

About Graph Planarity Checker

A graph planarity checker testing if G can be embedded in the plane without crossings. Kuratowski (1930): planar iff no K_5 or K_{3,3} subdivision. Euler's formula: V-E+F=2 for connected planar. Thus |E|≤3|V|-6. Client-side.

Graph Planarity Checker Features

  • Planar check
  • Euler V-E+F=2
  • |E|≤3V-6
  • Kuratowski
  • Face count
Advertisement
Advertisement