| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437802 | Theoretical Computer Science | 2009 | 7 Pages |
Abstract
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(n2m).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
