Sequence Enumeration and the de Bruijn-Van Aardenne Ehrenfest-Smith-Tutte Theorem

DOI10.4153/CJM-1979-054-xzbMath0431.05004OpenAlexW2319287160MaRDI QIDQ3867829

David M. Jackson, Ian P. Goulden

Publication date: 1979

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1979-054-x

zbMATH Keywords

generating functiondirected graphdirected Hamilton cyclesEulerian dicircuitsrooted spanning arborescencessequences over a finite alphabet

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Functional equations and inequalities (39B99)

Related Items

A combinatorial proof of the multivariable Lagrange inversion formula, A Formal Calculus for the Enumerative System of Sequences-III. Further Developments