In this talk, we give a graph theoretic combinatorial interpretation for expansions of cluster variables arising in cluster algebras of classical type. In particular, we explicitly construct a family of graphs such that a weighted enumeration of their perfect matchings encodes the numerator of the associated Laurent polynomials while decompositions of the graphs correspond to the denominator.