spanning forests
Description: Acyclic subgraphs that include every vertex of a graph, with each connected component forming a spanning tree; studied in graph theory and combinatorics.
Primary topic: Complexity and Algorithms in Graphs (21%)
OpenAlex ID: keywords/spanning-forests
