Recognise connected acyclic graphs; find subgraph that includes all vertices with no cycles.