An acyclic spanning subgraph containing a spanning tree of each connected component of the original graph. For a graph with vertices and components, a spanning forest has edges.

Ancestors (5)

  1. Graph theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

Incoming links (3)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version