Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. Counting patterns in graphs: a necessary planarity condition;Guardabassi,1966
2. Counting paths, circuits, chains and cycles in graphs: a unified approach;Biondi;Canad. J. Math.,1970
3. A mechanical counting method and combinatorial applications;Wilf;J. Combinatorial Theory,1968
4. Indirect counting trees in linear graphs;Guardabassi;J. Franklin Inst.,1971