The number of faces

Task number: 4254

Show that the number of faces in a planar graph drawing with \( n \ge 3 \) vertices is at most:

  • Variant


  • Variant

    \( n-2 \) if the graph does not contain any triangle.

Difficulty level: Easy task (using definitions and simple reasoning)
Routine calculation training
Cs translation
Send comment on task by email