Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three |
scientific article; zbMATH DE number 3908480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three |
scientific article; zbMATH DE number 3908480 |
Statements
Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (English)
0 references
1984
0 references
An algorithm for enumerating and listing all 1-factors for a class of graphs with all vertices of degree 2 or 3 is presented. This problem is of interest to physical sciences and is related to the problem of assigning Kekulé structures to a given conjugated molecules. The paper contains a flow-chart of the algorithm and its FORTRAN code.
0 references
algorithm
0 references
enumerating
0 references
listing
0 references
1-factors
0 references
FORTRAN
0 references
0.8544533
0 references
0.8534922
0 references
0.8516497
0 references
0.84943354
0 references
0.84491646
0 references
