Nash-Williams theorem (Q65066994)
Jump to navigation
Jump to search
Theorem in graph theory describing number of edge-disjoint spanning trees a graph can have
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nash-Williams theorem |
Theorem in graph theory describing number of edge-disjoint spanning trees a graph can have |
Statements
Identifiers
Sitelinks
Wikipedia(1 entry)
- enwiki Nash-Williams theorem