Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles (Q410649)

Summary: For a graph \(G\), let \(P(G, \lambda)\) be its chromatic polynomial. Two graphs \(G\) and \(H\) are chromatically equivalent, denoted \( G \sim H\), if \(P(G, \lambda) = P(H, \lambda)\). A graph \(G\) is chromatically unique if \(P(H, \lambda) = P(G, \lambda)\) implies that \(H \cong G\). In this paper, we determine all chromatic equivalence classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles. As a byproduct of these, we obtain various new families of \(\chi\)-equivalent graphs and \(\chi\)-unique graphs.