Forests of labeled trees

DOI10.1016/S0021-9800(68)80033-XzbMath0157.55001OpenAlexW2018392555MaRDI QIDQ5540276

John Riordan

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(68)80033-x

zbMATH Keywords

topology

Related Items (21)

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ A remark on the enumeration of rooted labeled trees ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ From Abel’s Binomial Theorem to Cayley’s Tree Formula ⋮ On Cayley's formula for counting forests ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Cutting down trees with a Markov chainsaw ⋮ A new combinatorial representation of the additive coalescent ⋮ Exceptional sequences and idempotent functions ⋮ A recursive algorithm for trees and forests ⋮ A bijective proof of the Shor recurrence ⋮ A new bijection on rooted forests ⋮ The structure of elements in finite full transformation semigroups ⋮ Mappings of acyclic and parking functions ⋮ Preuves combinatoires des identites d'Abel ⋮ Counting forests ⋮ Sums of r-Lah numbers and r-Lah polynomials ⋮ Coalescent random forests ⋮ Preuves combinatoires des identites d'Abel ⋮ Ballots and rooks

This page was built for publication: Forests of labeled trees