research

Fullerene graphs have exponentially many perfect matchings

Authors
Publication date
1 August 2009
Publisher
'Springer Science and Business Media LLC'
Doi
    View on arXiv

    Abstract

    A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.Comment: 7 pages, 3 figure

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Hal-Diderot

      redirect
      oaioai:HAL:hal-00487070v1
      Last time updated on 08/11/2016

      Crossref

      redirect
      Last time updated on 02/01/2020