Publication:5616724
From MaRDI portal
zbMath0214.23204MaRDI QIDQ5616724
Publication date: 1970
05C05: Trees
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
Related Items
Packing and Covering Constants for Certain Families of Trees. II, Matchings in superpositions of (n, n)‐bipartite trees, Counting finite models, On the expected number of edges in a maximum matching of an (r,s)-tree, Enumerating alternating trees, Fast random generation of binary, t-ary and other types of trees, A new bijection on rooted forests, The specification of 2-trees, Counting forests, On the number of trees in a random forest, Applications of antilexicographic order. I: An enumerative theory of trees, Counting trees in directed regular multigraphs, On random mapping patterns, The \(r\)-Stirling numbers, Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes, On Cayley's formula for counting forests, Edge percolation on a random regular graph of low degree, On Postnikov's hook length formula for binary trees, Bijective linear time coding and decoding for \(k\)-trees, Global stability of multi-group epidemic models with distributed delays, Global-stability problem for coupled systems of differential equations on networks, On a random graph evolving by degrees, On generic forms of complementary graphs, Bandwidths and profiles of trees, On the number of paths and cycles for almost all graphs and digraphs, The number of trees with a 1-factor, Survival under random coverings of trees, Some methods for computing component distribution probabilities in relational structures, Spanning tree formulas and Chebyshev polynomials, Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics, The road-colouring problem, Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange, Tree counting polynomials for labelled graphs. I: Properties, Une théorie combinatoire des séries formelles, Multichains, non-crossing partitions and trees, The outer-distance of nodes in random trees, Tree codes that preserve increases and degree sequences, Voting blocks, reluctant functions, and a formula of Hurwitz, Counting complements in the partition lattice, and hypertrees, Computation of the expected number of leaves in a tree having a given automorphism, and related topics, Identities of Rothe-Abel-Schläfli-Hurwitz-type, Matchings in random superpositions of bipartite trees, Counting colorful multi-dimensional trees, A coding algorithm for Rényi trees, Distributions on bicoloured binary trees arising from the principle of parsimony, The Fibonacci numbers via trigonometric expressions, The distribution of degrees in a large random tree, On enumerating paths of K arcs in unoriented complete graphs, Cayley's formula for multidimensional trees, Classification and enumeration of minimum (d, 3, 3)-graphs for odd d, Matrix tree theorems, Coalescent random forests, Tree and forest weights and their application to nonuniform random graphs, Some determinant expansions and the matrix-tree theorem, Counting bichromatic evolutionary trees, Graph-theoretic interpretation of the generalized row sum method, On a family of hyperplane arrangements related to the affine Weyl groups, Enumeration of noncrossing trees on a circle, Factorizations of some weighted spanning tree enumerators, Computing Prüfer codes efficiently in parallel, Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions, T. L. Hill's graphical method for solving linear equations, Cutting down recursive trees, On the largest component of the random graph at a nearcritical stage, Forest matrices around the Laplacian matrix, Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti, Isolating the most recent entry in a random recursive tree by random cuts, On the asymptotic behavior of the independence number of a random \((n,n)\)-tree, Polygon scheduling, Enumeration of (uni- or bicolored) plane trees according to their degree distribution, On coding labeled trees, Enumeration of algebras close to absolutely free algebras and binary trees, Enumeration and limit laws for series-parallel graphs, Unicyclic and bicyclic graphs having minimum degree distance, Formulas for counting acyclic digraph Markov equivalence classes, Random packings and coverings in random trees, Principles of cost minimisation in wireless networks, Cyclic schedules for r irregularity occurring events, On the Most Probable Shape of a Search Tree Grown from a Random Permutation, On Operator and Formal Sum Methods for Graph Enumeration Problems, Positive Definite Matrices and Catalan Numbers, Revisited, A graph-theoretic approach to the method of global Lyapunov functions, Colouring Random Empire Trees, Simplicial matrix-tree theorems, On maximal independent sets of nodes in trees, A Random Graph With a Subcritical Number of Edges, A Combinatorial Proof of the All Minors Matrix Tree Theorem, Climbing certain types of rooted trees. II
