Forest (graph theory): Difference between revisions
Jump to navigation
Jump to search
imported>Daniel Mietchen (started as lemma) |
(No difference)
|
Latest revision as of 16:46, 4 August 2010
Forest (graph theory) [r]: In mathematics, an undirected graph with no cycles. [e]
This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.