4
$\begingroup$

I wonder if there is a special category for this kind of graphs, I am thinking of a bidirectional graph but it would also be interesting in the cases when it is undirected.

I am thinking of something like recursively cyclic maby.

$\endgroup$

1 Answer 1

8
$\begingroup$

Such a graph is called bridgeless.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.