Pages that link to "Item:Q3734421"
From MaRDI portal
The following pages link to An application of circuit polynomials to the counting of spanning trees in graphs (Q3734421):
Displaying 12 items.
- Counting trees in directed regular multigraphs (Q757413) (← links)
- Forest decompositions of graphs with cyclomatic number 3 (Q790822) (← links)
- Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs (Q950661) (← links)
- Cycles and spanning trees (Q1179106) (← links)
- On polynomials of spanning trees (Q1977729) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Counting the number of spanning trees of graphs (Q2820129) (← links)
- (Q3616004) (← links)
- (Q3816110) (← links)
- Countingk-component forests of a graph (Q4022730) (← links)
- (Q4203044) (← links)
- Transformations of a graph increasing its Laplacian polynomial and number of spanning trees (Q5961460) (← links)