Graph TheorySuperchallengeGraph Coloring
Graph Coloring · Superchallenge problem
A planar triangulation (every face, including the unbounded one, is a triangle) has vertices. By the planar edge bound (tight for triangulations), it has edges. What is the sum of the degrees of all vertices?