Ivan Shishkin, Birch Grove

Connected graph

Definition / Combinatorics / Usable

English
EnglishFrançais
Usable. This concept is clear enough to use, but has not yet been reviewed by another trusted user.

A graph is said to be connected if and only if for any pair of vertices of this graph, there exists a sequence of adjacent edges that connect the first vertex to the second.

If the graph is directed, one adds the condition that this path also need to be directed.

Practice this concept with exercises

  • Soit GG, un graphe à nn sommets. Montrer que si GG est connexe, alors il possède au moins n−1n-1 arêtes.

    Open exerciseDifficulty 19/100 · 0 solutions · 0 hints
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.