Perfect matchings in hexagonal systems


A simple algorithm is developed which allows to decide whether or not a given hexagonal system has a perfect matching (and to find such a matching). This decision is also of chemical relevance since a hexagonal system is the skeleton of a benzenoid hydrocarbon molecule if and only if it has a perfect matching.

This is a preview of subscription content, access via your institution.


  1. [1]

    F. Harary, The cell growth problem and its attempted solutions,Beiträge zur Graphentheorie (Int. Koll. Manebach, 9–12. Mai 1967), ed. H. Sachs, H.—J. Voss, and H. Walther. B. G. Teubner Verlagsgesellschaft Leipzig 1968, 49–60.

  2. [2]

    J. E. Hopcroft andR. M. Karp, An 5/2 algorithm for maximum matchings in bipartite graphs,SIAM J. Comput. 2 (1973) 225–231.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.

    Google Scholar 

Download references

Author information



Additional information

Dedicated to Paul Erdős on his seventieth birthday

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sachs, H. Perfect matchings in hexagonal systems. Combinatorica 4, 89–99 (1984).

Download citation

AMS subject classification (1980)

  • 05 B 50, 05 C 70, 05 C 75, 05 C 38
  • 81 G 55