Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
Publications de l'Institut Mathématique (1984)
- Volume: 35(49), Issue: 55, page 33-40
- ISSN: 0350-1302
Access Full Article
top
How to cite
topIvan Gutman, and 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 35(49).55 (1984): 33-40. <http://eudml.org/doc/257671>.
@article{IvanGutman1984,
author = {Ivan Gutman, Dragoš Cvetković},
journal = {Publications de l'Institut Mathématique},
keywords = {Tricyclic graphs; maximal number of matchings; computer search; interactive programming system "GRAPH"},
language = {eng},
number = {55},
pages = {33-40},
publisher = {Matematički institut SANU},
title = {Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory},
url = {http://eudml.org/doc/257671},
volume = {35(49)},
year = {1984},
}
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
PB - Matematički institut SANU
VL - 35(49)
IS - 55
SP - 33
EP - 40
LA - eng
KW - Tricyclic graphs; maximal number of matchings; computer search; interactive programming system "GRAPH"
UR - http://eudml.org/doc/257671
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.