With my uncanny guessing abilities :-) I finally derived the size of the vector space where a n-valent node of a graph, edge-colored with the irreps $R_k, 1\le{k}\le{n}$ "lives". (I.e. in how many linear independent diagrams you decompose it, see e.g. "Birdtracks".) It's (heavy notation abuse) $\sharp{(1)}\in\Pi^\bigotimes_n{R_k}$ or, since this likely causes a syntax crash, in words: Just tensor multiply all the $R_k$ and count how many copies of the trivial irrep $1$ you find in the product. (Can you verify my finding?)
Especially, for n=3 this means (excuse my ASCII) a triangle =|>- reduces either to 6j* >- or zero if >- is inadmissible (the triple product doesn't contain $1$). But haaaalt! Assume all irreps here are $(1,1)$ from $A_2$. $(1,1)\bigotimes(1,1)$ contains TWO copies of $(1,1)$ and thus the triple product two $1$, i.e. there exist two linear independent graphs with three open ends.
Which means =|>- should be something like 6j* >- + 6j* >- ...but there are no two >-, you can only build this one acyclic graph! On the other hand: 6j symbols being undefined due to multiplicity >1 - I would have heard of that. Where is the hole in my logic?