The Enumeration of Point Labelled Chromatic Graphs and Trees

Cited in

(27)

The number of spanning trees of a complete multipartite graph
On the expected number of edges in a maximum matching of an (r,s)-tree
Spanning trees: A survey
Bridge-addability, edge-expansion and connectivity
scientific article; zbMATH DE number 3396878 (Why is no real title available?)
Counting colorful multi-dimensional trees
A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes
Express the number of spanning trees in term of degrees
Cross-Multiplicative Coalescent Processes and Applications
On two conjectures concerning spanning tree edge dependences of graphs
The frequency of convergent games under best-response dynamics
Appearance of complex components in a random bigraph
On computing accurate singular values and eigenvalues of matrices with acyclic graphs
The number of rooted forests in circulant graphs
scientific article; zbMATH DE number 1545678 (Why is no real title available?)
On a conjecture regarding spanning tree edge dependences of planar graphs
A generalization of the matrix-tree theorem
scientific article; zbMATH DE number 3248830 (Why is no real title available?)
Construction of efficient experimental designs under multiple resource constraints
A recursive algorithm for trees and forests
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
Linear algebraic techniques for spanning tree enumeration
The asymptotic number of spanning forests of complete bipartite labelled graphs
Random packings and coverings in random trees
The number of minimally connected block designs
Spanning tree enumeration and nearly triangular graph Laplacians
Number of spanning trees of different products of complete and complete bipartite graphs

This page was built for publication: The Enumeration of Point Labelled Chromatic Graphs and Trees

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