Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three (Q1061146): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3907599 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3317158 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the theory of the matching polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theory of monomer-dimer systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Revision as of 17:17, 14 June 2024
scientific article
| 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 |
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
