The following pages link to The number of trees (Q2647861):
Displaying 50 items.
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere (Q278890) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- On extreme \(U_1\) matrices (Q389656) (← links)
- Random walks on quasirandom graphs (Q396948) (← links)
- On the Wiener index of random trees (Q411651) (← links)
- Equiseparability on terminal Wiener index (Q427678) (← links)
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (Q431520) (← links)
- The degree profile of random Pólya trees (Q439063) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Some remarks on inverse Wiener index problem (Q444451) (← links)
- Enumerating the total colorings of a polyhedron and application to polyhedral links (Q454297) (← links)
- On the Gomory-Hu inequality (Q460733) (← links)
- Enumerating stereo-isomers of tree-like polyinositols (Q460913) (← links)
- Counting glycans revisited (Q464771) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Counting extreme \(U_1\) matrices and characterizing quadratic doubly stochastic operators (Q528219) (← links)
- The asymptotic value of the Randić index for trees (Q550268) (← links)
- Topological phases: an expedition off lattice (Q555639) (← links)
- Gaussian limiting distributions for the number of components in combinatorial structures (Q582688) (← links)
- Asymptotics of combinatorial structures with large smallest component (Q598440) (← links)
- Energy-preserving integrators and the structure of B-series (Q604685) (← links)
- The number of monounary algebras (Q647328) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Stories about groups and sequences (Q677164) (← links)
- Bisection of trees and sequences (Q685643) (← links)
- On the symmetry and asymmetry of combinatorial structures (Q688675) (← links)
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees (Q693717) (← links)
- The specification of 2-trees (Q696853) (← links)
- The shape of unlabeled rooted random trees (Q710724) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- On the number of trees in a random forest (Q754228) (← links)
- The numbers of labeled colored and chromatic trees (Q768644) (← links)
- The number of homeomorphically irreducible trees, and other species (Q770044) (← links)
- Theory of gravitational perturbations in the fast motion approximation (Q772460) (← links)
- On random mapping patterns (Q788742) (← links)
- Counting and coding identity trees with fixed diameter and bounded degree (Q789398) (← links)
- Points by degree and orbit size in chemical trees. II (Q795055) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree (Q890484) (← links)
- Counting graceful labelings of trees: a theoretical and empirical study (Q897585) (← links)
- Combinatorial enumeration of three-dimensional trees as stereochemical models of alkanes: An approach based on Fujita's proligand method and dual recognition as uninuclear and binuclear promolecules (Q926923) (← links)
- Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity (Q949511) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Exact unprovability results for compound well-quasi-ordered combinatorial classes (Q1006603) (← links)
- Phase transitions for Gödel incompleteness (Q1006619) (← links)
- Structure and enumeration of two-connected graphs with prescribed three-connected components (Q1023394) (← links)
