Gutman, Ivan; Cvetković, Dragoš Finding tricyclic graphs with a maximal number of matchings - another example of computer aided research in graph theory. (English) Zbl 0561.05043 Publ. Inst. Math., Nouv. Sér. 35(49), 33-40 (1984). From the authors’ abstract: ”Tricyclic graphs on n vertices with maximal number of matchings are determined by a computer search for small values of n and an induction argument for the rest. The computer search is performed by the interactive programming system ”GRAPH”, implemented at the University of Belgrade, and represents a typical example of the usage of this system in scientific research.” Reviewer: C.Godsil Cited in 1 ReviewCited in 11 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C35 Extremal problems in graph theory 68R10 Graph theory (including graph drawing) in computer science Keywords:Tricyclic graphs; maximal number of matchings; computer search; interactive programming system ”GRAPH” PDFBibTeX XMLCite \textit{I. Gutman} and \textit{D. Cvetković}, Publ. Inst. Math., Nouv. Sér. 35(49), 33--40 (1984; Zbl 0561.05043) Full Text: EuDML