Chromatic uniqueness of the generalized θ-graph

Abstract A generalized θ-graph in a connected graph with 3 paths between a pair of vertices of degree 3. It is shown that any graph having the same chromatic polynomial as a generalized θ-graph, must be isomorphic to the generalized θ-graph.