On Operator and Formal Sum Methods for Graph Enumeration Problems

Abstract

This article investigates some computational aspects of the operator approaches recently introduced by the authors for graph enumeration problems involving forests, subgraphs with fixed cyclomatic numbers and matchings.