Ivan Shishkin, Birch Grove

Concept

Connected graph

Combinatorics / Usable / edited by Ancient Tree

0 talk posts

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.

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.