scientific article; zbMATH DE number 3198646
From MaRDI portal
Publication:5734985
Cited in
(14)- The number of minimally connected block designs
- On two conjectures concerning spanning tree edge dependences of graphs
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution
- scientific article; zbMATH DE number 3396878 (Why is no real title available?)
- On the Euler characteristic of Kronecker moduli spaces
- The asymptotic number of spanning forests of complete bipartite labelled graphs
- Planarity and genus of sparse random bipartite graphs
- Enumeration of \(m\)-ary cacti
- Component behaviour and excess of random bipartite graphs near the critical point
- A generalization of the matrix-tree theorem
- Spanning tree enumeration and nearly triangular graph Laplacians
- Linear algebraic techniques for spanning tree enumeration
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Bridge-addability, edge-expansion and connectivity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5734985)
