A Note on Assigning a Kekule Structure to a Chemical Graph


BibTeX reference

The Edmonds Matching Algorithm, which leads easily to finding a Kekulé structure in a chemical graph, is recalled. An extension is made to the case where only vertices of a specified set must be covered by edges of the matching which is sought.

, 15 pages