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 ) .

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2009-05, Vol.410 (21), p.2234-2240
Hauptverfasser:	Lévêque, Benjamin, Maffray, Frédéric, Reed, Bruce, Trotignon, Nicolas
Format:	Artikel
Sprache:	eng
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 ) .
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2009.02.012