ArticleTalk · 0HistoryEnglishEnglishAdd translationThis article is a stubA graph is said to be finite if it has a finite number of vertices. Problems using this concept (1)Eulerian path in a finite graphProblems using this concept (spoiler) (0)No listed problems use this concept as a spoiler yet.