Pages that link to "Item:Q2239004"
From MaRDI portal
The following pages link to The maximum number of spanning trees of a graph with given matching number (Q2239004):
Displaying 8 items.
- The number of maximum matchings in a tree (Q409365) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Characterization of a class of graphs related to pairs of disjoint matchings (Q1011703) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- A new technique for the characterization of graphs with a maximum number of spanning trees (Q1349105) (← links)
- On numbers of vertices of maximum degree in the spanning trees of a graph (Q1923502) (← links)
- (Q3801573) (← links)
- On graphs with the maximum number of spanning trees (Q4894608) (← links)