Cycles · Cycles of Even Length (Optional)

Lesson 7

Nikolai Chukhin · Alexander S. Kulikov

Problem. Let \(H\) be a connected graph with a \(5\)-periodic coloring using three colors. Which statement must be true?

1 point

  1. \(e(H)<5v(H)\).

  2. \(e(H)\ge 5v(H)\).

  3. \(H\) contains an odd cycle.

  4. \(H\) has a vertex whose deletion disconnects the graph.