Abstract
The bichromatic triangle polynomial counts vertex k-colorings in which every triangle uses exactly two colors. We develop a transfer matrix framework for three canonical families of 2-trees: book graphs , 1-fans , and triangulated ladders . In each case, satisfies a second-order linear recurrence with an explicit closed form; for this yields a Chebyshev representation, while for the binary specialization gives . A spectral identity links the dominant characteristic roots of the fan and ladder recurrences, implying identical exponential growth rates when indexed by vertex count, whereas book graphs grow strictly faster for . In fact, this correspondence is exact: for all , the triangulated ladder polynomial coincides with that of a suitably indexed 1-fan. Passing to line graphs, we interpret as counting edge colorings of that forbid both monochromatic and rainbow triangles, and we identify a sharp obstruction threshold at .