Rui Pedro Carpentier
Published 2010-09-13, updated 2010-09-29Version 2
Penrose's work \cite{8} established a connection between the edge 3-colorings of cubic planar graphs and tensor algebras. We exploit this point of view in order to get algebraic representations of the category of cubic graphs with free ends.
Comments: 11 pages, many figures and diagrams
Reflexive coloring complexes for 3-edge-colorings of cubic graphs
Delay colourings of cubic graphs
An improved linear bound on the number of perfect matchings in cubic graphs
![QR code for arXiv:1009.2446 [math.CO]](http://oss.arxitics.com/images/favicon.svg)