Faces in a planar drawing

Task number: 4271

Show that in the maximum (in terms of number of edges) 2-connnected planar graph without triangles, each face is bounded by either a fourcycle or by a fivecycle.

  • Solution

    Diagonals can be supplied for larger faces.

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