A spanning tree for a connected graph can be found as a maximal tree, a maximal forest, or a minimal graph with edges containing all the vertices; Zorn's lemma can be used on any of those classes of graphs. — Arthur Rubin (talk) 07:04, 10 June 2019 (UTC)