Enumeration of spanning trees of certain graphs

DOI10.1070/RM1990V045N03ABEH002352MaRDI QIDQ4713139zbMATH OpenOpenAlexFDO

Authors Igor Pak, A. E. Postnikov

Publication date 25 June 1992

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm1990v045n03abeh002352

zbMATH Keywords

multipartite graphspanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• An algorithm for the enumeration of spanning trees
• scientific article; zbMATH DE number 2076810
• scientific article; zbMATH DE number 2104825
• An algorithm for enumerating all spanning trees of a directed graph

Cited in

(17)

• An algorithm for the enumeration of spanning trees
• A blossoming algorithm for tree volumes of composite digraphs
• Spanning trees of descendants of a complete graph
• Enumeration of spanning trees of 2-separable networks
• Enumeration of subtrees of planar two-tree networks
• Counting spanning trees using modular decomposition
• On encodings of spanning trees
• Colouring Random Empire Trees
• Enumerating Constrained Non-crossing Geometric Spanning Trees
• scientific article; zbMATH DE number 672342 (Why is no real title available?)
• scientific article; zbMATH DE number 2076810 (Why is no real title available?)
• scientific article; zbMATH DE number 2104825 (Why is no real title available?)
• scientific article; zbMATH DE number 7499713 (Why is no real title available?)
• Enumeration of spanning trees in a chain of diphenylene graphs
• Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
• scientific article; zbMATH DE number 7771742 (Why is no real title available?)
• Around the number of trees in distance-hereditary graphs

This page was built for publication: Enumeration of spanning trees of certain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713139)