For example, prove that a graph has an even number of vertices of odd degree; prove that a graph has an Euler cycle if and only if the graph is connected and every vertex has even degree; prove that any tree with 𝑛 vertices has 𝑛 – 1 edges.

Lessons for this standard

Resources cannot be aligned to this standard, browse sub-standards to find lessons.