The enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors
From MaRDI portal
Publication:6473758
Abstract: 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).
This page was built for publication: The enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473758)
