Edges on a common cycle

Task number: 3968

Show that every conneected graph on at least three vertices is 2-connected if and only if:

  • Variant

    Every two edges lie on a common cycle.

  • Variant

    Every two adjacent edges lie on a common cycle.

Difficulty level: Moderate task
Proving or derivation task
Cs translation
Send comment on task by email