Spanning
Summary
A subgraph is spanning when it includes all of the vertices of the given graph. Important cases include spanning trees (spanning subgraphs that are trees) and perfect matchings (spanning subgraphs that are matchings). A spanning subgraph may also be called a factor, especially (but not only) when it is regular.
Further reading
- Wikipedia, page 325802, revision 1373839425, Glossary of graph theory, section S. adopted
About this page
| Tag | PT8MSXSB4Z |
|---|---|
| URI | m2://PT8MSXSB4Z |
| Aliases | spanning-subgraph |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.