Coloring Artemis graphs

Authors:
Benjamin Lévêque;Frédéric Maffray;Bruce Reed;Nicolas Trotignon
Affiliations:
Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France;C.N.R.S., Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France;School of Computer Science, McGill University, 3480 University, Montreal, Quebec, Canada H3A 2A7;Centre dÉconomie de la Sorbonne, Université de Paris 1 Panthéon-Sorbonne, 106-112, Boulevard de lHôpital, 75647 Paris cedex 13, France
Venue:
Theoretical Computer Science
Year:
2009

Citing 12
Cited 1

On the complexity of recognizing perfectly orderable graphs

Discrete Mathematics
Perfectly contractile graphs

Journal of Combinatorial Theory Series B
Meyniel weakly triangulated graphs—I: co-perfect orderability

Discrete Applied Mathematics
Meyniel weakly triangulated graphs II: a theorem of Dirac

Discrete Applied Mathematics
Weakly chordal graph algorithms via handles

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An O(n2) algorithm to color Meyneil graphs

Discrete Mathematics
Robust algorithms for restricted domains

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Algorithms for Perfectly Contractile Graphs

SIAM Journal on Discrete Mathematics
A class of perfectly contractile graphs

Journal of Combinatorial Theory Series B
Improved algorithms for weakly chordal graphs

ACM Transactions on Algorithms (TALG)
Precoloring Extension of Co-Meyniel Graphs

Graphs and Combinatorics
Even pairs in Berge graphs

Journal of Combinatorial Theory Series B

Graph transformations preserving the stability number

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

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