3 ms·

any loop-free graph which is connected (a 2 unlinked dot graph would be loop-free, but wouldn't be a tree) (to complement cperciva's answer with a counter exam

by jraph 2y ago

any loop-free graph which is connected (a 2 unlinked dot graph would be loop-free, but wouldn't be a tree) (to complement cperciva's answer with a counter example)