The following pages link to (Q5616724):
Displayed 50 items.
- Fast random generation of binary, t-ary and other types of trees (Q582880) (← links)
- A new bijection on rooted forests (Q686461) (← links)
- The specification of 2-trees (Q696853) (← links)
- Counting forests (Q750454) (← links)
- On the number of trees in a random forest (Q754228) (← links)
- Applications of antilexicographic order. I: An enumerative theory of trees (Q757391) (← links)
- Counting trees in directed regular multigraphs (Q757413) (← links)
- On random mapping patterns (Q788742) (← links)
- The \(r\)-Stirling numbers (Q790812) (← links)
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes (Q791200) (← links)
- On Cayley's formula for counting forests (Q912847) (← links)
- Edge percolation on a random regular graph of low degree (Q941299) (← links)
- On Postnikov's hook length formula for binary trees (Q942125) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Global stability of multi-group epidemic models with distributed delays (Q1036155) (← links)
- Global-stability problem for coupled systems of differential equations on networks (Q1046474) (← links)
- On a random graph evolving by degrees (Q1047669) (← links)
- On generic forms of complementary graphs (Q1056766) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- On the number of paths and cycles for almost all graphs and digraphs (Q1076688) (← links)
- The number of trees with a 1-factor (Q1085165) (← links)
- Survival under random coverings of trees (Q1104333) (← links)
- Some methods for computing component distribution probabilities in relational structures (Q1105605) (← links)
- Spanning tree formulas and Chebyshev polynomials (Q1106235) (← links)
- Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics (Q1146185) (← links)
- The road-colouring problem (Q1157339) (← links)
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange (Q1160127) (← links)
- Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
- Une théorie combinatoire des séries formelles (Q1167168) (← links)
- Multichains, non-crossing partitions and trees (Q1170241) (← links)
- The outer-distance of nodes in random trees (Q1173095) (← links)
- Tree codes that preserve increases and degree sequences (Q1174170) (← links)
- Voting blocks, reluctant functions, and a formula of Hurwitz (Q1174173) (← links)
- Counting complements in the partition lattice, and hypertrees (Q1176383) (← links)
- Computation of the expected number of leaves in a tree having a given automorphism, and related topics (Q1182309) (← links)
- Identities of Rothe-Abel-Schläfli-Hurwitz-type (Q1191959) (← links)
- Matchings in random superpositions of bipartite trees (Q1195420) (← links)
- Counting colorful multi-dimensional trees (Q1200270) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- Distributions on bicoloured binary trees arising from the principle of parsimony (Q1208487) (← links)
- The Fibonacci numbers via trigonometric expressions (Q1214423) (← links)
- The distribution of degrees in a large random tree (Q1218434) (← links)
- On enumerating paths of K arcs in unoriented complete graphs (Q1219305) (← links)
- Cayley's formula for multidimensional trees (Q1220079) (← links)
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d (Q1241756) (← links)
- Matrix tree theorems (Q1245845) (← links)
- Coalescent random forests (Q1284161) (← links)
- Tree and forest weights and their application to nonuniform random graphs (Q1296594) (← links)
- Some determinant expansions and the matrix-tree theorem (Q1313835) (← links)
- Counting bichromatic evolutionary trees (Q1314318) (← links)