scientific article; zbMATH DE number 7771742
From MaRDI portal
Publication:6072058
Recommendations
- Enumeration of spanning trees of certain graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- scientific article; zbMATH DE number 861414
- The enumeration of spanning tree of weighted graphs
- Enumeration of spanning trees of graph: alternative methods
- Enumerating Constrained Non-crossing Geometric Spanning Trees
- An algorithm for the enumeration of spanning trees
- Enumerating spanning trees of graphs with an involution
- An algorithm for enumerating all spanning trees of a directed graph
- Counting the number of spanning trees of graphs
Cites work
- A simple formula for the number of spanning trees of line graphs
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- Counting spanning trees in almost complete multipartite graphs
- Enumerating spanning trees of graphs with an involution
- Enumerative properties of Ferrers graphs
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- Linear algebraic techniques for weighted spanning tree enumeration
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- Simplicial matrix-tree theorems
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- The enumeration of spanning tree of weighted graphs
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072058)
