The enumeration of edge colorings and Hamiltonian cycles by means of   symmetric tensors
  Following Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of arbitrary length in graphs (in particular, Hamiltonian cycles). 
Peter Zograf