scientific article; zbMATH DE number 3198646
From MaRDI portal
Publication:5734985
zbMATH Open0122.41901MaRDI QIDQ5734985FDOQ5734985
Authors: H. I. Scoins 
Publication date: 1962
Title of this publication is not available (Why is that?)
Cited In (14)
- Enumeration of \(m\)-ary cacti
- Bridge-addability, edge-expansion and connectivity
- Title not available (Why is that?)
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution
- On two conjectures concerning spanning tree edge dependences of graphs
- Planarity and Genus of Sparse Random Bipartite Graphs
- A generalization of the matrix-tree theorem
- On the Euler characteristic of Kronecker moduli spaces
- Linear algebraic techniques for spanning tree enumeration
- The asymptotic number of spanning forests of complete bipartite labelled graphs
- Spanning tree enumeration and nearly triangular graph Laplacians
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- The number of minimally connected block designs
- Component behaviour and excess of random bipartite graphs near the critical point
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)
