Spanning trees and function classes

zbMATH Open1005.05015MaRDI QIDQ698608FDOQ698608

S. Gill Williamson, Jeffrey Remmel

Publication date: 22 September 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122365

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 1424297
• Generalized spanning trees
• Spanning trees and Hamiltonicity
• An Application of Spanning Trees to k -Point Separating Families of Functions
• scientific article; zbMATH DE number 1484041
• Spanning trees of extended graphs
• scientific article; zbMATH DE number 3908451
• Spanning trees and hierarchical networks
• scientific article; zbMATH DE number 4002122
• Tree structures associated to a family of functions

zbMATH Keywords

filtered digraphsoriented spanning forests

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cited In (7)

• Factorizations of some weighted spanning tree enumerators
• A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
• The uncover process for random labeled trees
• Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
• A CLASS OF GRAPHS WHICH HAS EFFICIENT RANKING AND UNRANKING ALGORITHMS FOR SPANNING TREES AND FORESTS
• A bijective enumeration of labeled trees with given indegree sequence
• Simplicial matrix-tree theorems

This page was built for publication: Spanning trees and function classes

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