An acyclic graph, one not containing any cycles, is called a forest.
~
DIESTEL, Reinhard, 2025. Graph theory. Sixth edition. Berlin [Heidelberg]: Springer. Graduate texts in mathematics, volume 173. ISBNÂ 978-3-662-70107-2, p. 13.
ForestAn acyclic graph, one not containing any cycles, is called a forest.
~
DIESTEL, Reinhard, 2025. Graph theory. Sixth edition. Berlin [Heidelberg]: Springer. Graduate texts in mathematics, volume 173. ISBNÂ 978-3-662-70107-2, p. 13.