Nash-Williams theorem
(Q65066994)
Theorem in graph theory describing number of edge-disjoint spanning trees a graph can have
Theorem in graph theory describing number of edge-disjoint spanning trees a graph can have
Language:
Current Data About
Nash-Williams theorem
other details
| description | Theorem in graph theory describing number of edge-disjoint spanning trees a graph can have |
External Links
| (P2671) |
/g/11h749plpm
|