Determinantal generating functions of colored spanning forests
Summary: The color type of a spanning forest of a graph with colored edges is defined and, subsequently, it is proved that the generating function of such spanning forests is obtained as the formal expansion of a certain determinant. An analogous determinantal expansion yields the generating function of all spanning forests of a given color type that contain a specific subforest. Algorithms are described for obtaining a list of all colored spanning trees and spanning forests of any graph with colored edges based on symbolic calculation.
- An enumerating function for spanning forests with color restrictions
- Determinantal spanning forests on planar graphs
- Spanning tree generating functions and Mahler measures
- The generalized Turán number of spanning linear forests
- \((g,f)\)-chromatic spanning trees and forests
- Colored trees and noncommutative symmetric functions
- Chromatic polynomials of generalized trees
- scientific article; zbMATH DE number 6909317
- The chromatic generating function
- Further results on the generalized Turán number of spanning linear forests
This page was built for publication: Determinantal generating functions of colored spanning forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774658)
