EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 35(49), pp. 33--40 (1984)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

FINDING TRICYCLIC GRAPHS WITH A MAXIMAL NUMBER OF MATCHINGS -- ANOTHER EXAMPLE OF COMPUTER AIDED RESEARCH IN GRAPH THEORY

Ivan Gutman and Dragos Cvetkoi\'c

Prirodno-matematicki fakultet, Kragujevac, Yugoslavia and Elektrotehnicki fakultet, Beograd, Yugoslavia

Classification (MSC2000): 05C70

Full text of the article:

Electronic fulltext finalized on: 3 Nov 2001. This page was last modified: 22 Aug 2002.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001--2002 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition