Coloring Artemis graphs

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 ( n 2 m ) .

Saved in:

Bibliographic Details
Published in	Theoretical computer science Vol. 410; no. 21; pp. 2234 - 2240
Main Authors	Lévêque, Benjamin, Maffray, Frédéric, Reed, Bruce, Trotignon, Nicolas
Format	Journal Article
Language	English
Published	Oxford Elsevier B.V 17.05.2009 Elsevier
Subjects	Algorithm Algorithmics. Computability. Computer arithmetics Applied sciences Coloring Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Discrete Mathematics Even pair Exact sciences and technology Graph Graph theory Information retrieval. Graph Mathematics Miscellaneous Perfect graph Sciences and techniques of general use Theoretical computing Coloring Graph Algorithm Perfect graph Even pair Hole Computer theory Color Triangle Graph colouring Perfect graphs Artemis graphs
Online Access	Get full text
ISSN	0304-3975 1879-2294 1879-2294
DOI	10.1016/j.tcs.2009.02.012

Cover

More Information
Summary:	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 ( n 2 m ) .
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0304-3975 1879-2294 1879-2294
DOI:	10.1016/j.tcs.2009.02.012