# Spanning tree

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Spanning tree](https://ocme.evemisslab.com/en/atlas/atlas-spanning-tree/)

A spanning tree is a connected acyclic subgraph containing every vertex of its parent graph.

atlas-spanning-tree · canonical_mko

[Spanning tree](https://ocme.evemisslab.com/en/mko/mko-spanning-tree/)

## Prerequisite nodes


- [Nonempty finite trees: connectivity, cycles, and unique paths](https://ocme.evemisslab.com/en/atlas/atlas-tree/)
- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Connected component](https://ocme.evemisslab.com/en/atlas/atlas-connected-component/)