The following pages link to Enumerating k-trees (Q2546877):
Displaying 13 items.
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- Random enriched trees with applications to random graphs (Q1658748) (← links)
- Bijections on \(r\)-Shi and \(r\)-Catalan arrangements (Q2040989) (← links)
- Binomial sequences (Q2180833) (← links)
- Limits of random tree-like discrete structures (Q2192232) (← links)
- Counting unlabeled \(k\)-trees (Q2452429) (← links)
- Graph limits of random unlabelled <i>k</i>-trees (Q4987257) (← links)
- Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses (Q6110570) (← links)
