Tag Archives: Embeddability

1. E ≤ 3V Let G be a simple planar graph with V vertices and E edges. It follows from Euler’s theorem that E ≤ 3V In fact, we have (when V is at least 3,) that E ≤ 3V – 6. … Continue reading →