Ivan Shishkin, Birch Grove

Finite graph

Definition / Combinatorics /

A graph is said to be finite if it has a finite number of vertices.

Problems using this concept (1)

Eulerian path in a finite graph

Problems using this concept (spoiler) (0)

No listed problems use this concept as a spoiler yet.