Depth-first search as a combinatorial correspondence
- 31 May 1979
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 26 (3) , 308-313
- https://doi.org/10.1016/0097-3165(79)90108-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The inversion enumerator for labeled treesBulletin of the American Mathematical Society, 1968
- Enumeration Of Labelled GraphsCanadian Journal of Mathematics, 1956