1.Previous
3.Next

is added to .
* is connected, but would become disconnected if any single edge is removed from .
* is connected and the complete graph is not a minor of .
* Any two vertices in can be connected by a unique simple path.If has finitely many vertices, say of them, then the above statements are also equivalent to any of the following

1.Previous
3.Next