We consider a monoidal category consisting of cubic graphs with free ends as morphisms between finite sets of points on a line (in the same sense as the category of tangles). We give a linear representation of this category that codifies the number of edge 3-colorings of cubic graphs. Some developments and conjectures will be presented.