We consider the class of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We give an algorithm that can optimally color the vertices of these graphs in time O (n2 m). © 2009 Elsevier B.V. All rights reserved.
Lévêque, B., Maffray, F., Reed, B., & Trotignon, N. (2009). Coloring Artemis graphs. Theoretical Computer Science, 410(21–23), 2234–2240. https://doi.org/10.1016/j.tcs.2009.02.012