A line perfect graph. These may equivalently be described as graphs whose line graphs are perfect, graphs with no odd cycle of length greater than three, or graphs in which each biconnected component is bipartite, K4, or K1,1,n. The edge colors indicate the type of each biconnected component: black for bipartite, blue for K4, and red for K1,1,n.
Own work
David Eppstein