A hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. A linear algorithm is proposed to find all fixed bonds in a hexagonal system which has a Kekulé structure, i.e. all edges belonging to all or none of the perfect matchings of that hexagonal system.
Paru en avril 1991 , 15 pages
Ce cahier a été révisé en août 1991