Geodesic
Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
Publications de l'Institut Mathématique, _N_S_35 (1984) no. 49, p. 33 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Tricyclic graphs on n vertices with maximal number of matchings are determined by a computer search for small values of $n$ and by 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.
Classification : 05C70 
@article{PIM_1984_N_S_35_49_a3,
     author = {Ivan Gutman and Drago\v{s} Cvetkovi\'c},
     title = {Finding {Tricyclic} {Graphs} with a {Maximal} {Number} of {Matchings} - {Another} {Example} of {Computer} {Aided} {Research} in {Graph} {Theory}},
     journal = {Publications de l'Institut Math\'ematique},
     pages = {33 },
     publisher = {mathdoc},
     volume = {_N_S_35},
     number = {49},
     year = {1984},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/PIM_1984_N_S_35_49_a3/}
}
TY  - JOUR
AU  - Ivan Gutman
AU  - Dragoš Cvetković
TI  - Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
JO  - Publications de l'Institut Mathématique
PY  - 1984
SP  - 33 
VL  - _N_S_35
IS  - 49
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PIM_1984_N_S_35_49_a3/
LA  - en
ID  - PIM_1984_N_S_35_49_a3
ER  - 
%0 Journal Article
%A Ivan Gutman
%A Dragoš Cvetković
%T Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
%J Publications de l'Institut Mathématique
%D 1984
%P 33 
%V _N_S_35
%N 49
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PIM_1984_N_S_35_49_a3/
%G en
%F PIM_1984_N_S_35_49_a3
Ivan Gutman; Dragoš Cvetković. Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory. Publications de l'Institut Mathématique, _N_S_35 (1984) no. 49, p. 33 . http://geodesic.mathdoc.fr/item/PIM_1984_N_S_35_49_a3/