pseudoforest

$|V| = |E|$, the graph

from matroid pseudoforest

• Pseudoforest - Wikipedia

  • undirected graph in which every connected component has at most one cycle.

  • 

This page is auto-translated from /nishio/pseudoforest using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.