arXiv:math/0403339 Abstract

arXiv:math/0403339 [math.CO]Abstract References Reviews Resources

The enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors

Published 2004-03-21Version 1

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).

Categories: math.CO

Keywords: hamiltonian cycles, symmetric tensors, enumeration, functions enumerate edge colorings, graph functions

Related articles: Most relevant | Search more

arXiv:1010.5614 [math.CO] (Published 2010-10-27)

Enumeration of linear chord diagrams

J. E. Andersen, R. C. Penner, C. M. Reidys, M. S. Waterman

arXiv:0907.0709 [math.CO] (Published 2009-07-03, updated 2009-12-11)

The enumeration of fully commutative affine permutations

Christopher R. H. Hanusa, Brant C. Jones

arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)

Enumeration of m-ary cacti

Miklos Bona, Michel Bousquet, Gilbert Labelle, Pierre Leroux