MathCastle
Graph TheoryEasyPlanar Graphs

Planar Graphs · Easy problem

A hexagonal field is triangulated by drawing diagonals from one corner to every corner it is not already adjacent to, with no two diagonals crossing. Counting the 66 boundary edges together with these diagonals, how many faces does the triangulated figure have, including the region outside the hexagon?