Skip to main content
SpringerLink
Log in

Perfect matchings in hexagonal systems

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

This paper deals with perfect matchings in hexagonal systems. Counterexamples are given to Sachs's conjecture in this field. A necessary and sufficient condition for a hexagonal system to have a perfect matching is obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sachs, H.: Perfect matchings in hexagonal systems. Combinatorica4(1), 89–99 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gutman, I.: Topological properties of benzenoid molecules. Bull. Soc. Chim. Beograd,47, 453–472 (1982)

    Google Scholar 

  3. Hall, P.: On representatives of subsets, J. London math. Soc.10, 26–30 (1935)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Xinjiang University, Urumchi, Xinjiang, People's Republic of China

    Zhang Fu-ji, Chen Rong-si & Guo Xiao-fong

Authors
  1. Zhang Fu-ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Rong-si
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guo Xiao-fong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu-ji, Z., Rong-si, C. & Xiao-fong, G. Perfect matchings in hexagonal systems. Graphs and Combinatorics 1, 383–386 (1985). https://doi.org/10.1007/BF02582965

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02582965

Keywords

Search

Navigation