Enumeration for no-trivial spanning forests of complete bipartite graphs.
From MaRDI portal
Publication:3115019
Recommendations
- Enumeration for spanning forests of complete bipartite graphs.
- scientific article; zbMATH DE number 2192142
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- Some applications of spanning trees in \(K_{s,t}\)
- On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
Cited in
(10)- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
- scientific article; zbMATH DE number 7499713 (Why is no real title available?)
- Enumeration for spanning forests of complete bipartite graphs.
- Combinatorial proof of an Abel-type identity
- Computing the number of \(h\)-edge spanning forests in complete bipartite graphs
- Some applications of spanning trees in \(K_{s,t}\)
- An f-chromatic spanning forest of edge-colored complete bipartite graphs
- Binomial identities generated by counting spanning trees.
- scientific article; zbMATH DE number 2192142 (Why is no real title available?)
This page was built for publication: Enumeration for no-trivial spanning forests of complete bipartite graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115019)
