The following pages link to (Q5066233):
Displaying 7 items.
- The number of spanning forests of a graph (Q1772421) (← links)
- Spanning forests of a digraph and their applications (Q1778400) (← links)
- The matrix of maximum out forests of a digraph and its applications (Q1882041) (← links)
- On the number of forests and connected spanning subgraphs (Q2053728) (← links)
- Spanning forests and the golden ratio (Q2476266) (← links)
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest (Q6047972) (← links)
- The number of ways to construct a connected graph: a graph-based generalization of the binomial coefficients (Q6135999) (← links)