An O( n2) algorithm to color Meyniel graphs

Meyniel graphs are the graphs in which every odd cycle with five vertices or more has at least two chords. In 1990, Hertz gave an O( mn) algorithm to color Meyniel graphs based on successive contractions of even pairs. We give here another algorithm which consists in simultaneously ordering (in a Le...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 235; no. 1; pp. 107 - 123
Main Authors Roussel, F., Rusu, I.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 28.05.2001
Elsevier
Subjects
Bioinformatics
Biotechnology
Coloring
Computational Complexity
Computer Science
Data Structures and Algorithms
Even pair
Greedy algorithm
Life Sciences
Mathematics
Perfect graphs
Probability
Quantitative Methods
Coloring
Greedy algorithm
Perfect graphs
Even pair
Online AccessGet full text
ISSN0012-365X
1872-681X
DOI10.1016/S0012-365X(00)00264-8

Cover

More Information
Summary:Meyniel graphs are the graphs in which every odd cycle with five vertices or more has at least two chords. In 1990, Hertz gave an O( mn) algorithm to color Meyniel graphs based on successive contractions of even pairs. We give here another algorithm which consists in simultaneously ordering (in a Lex-BFS way) and coloring (with the greedy algorithm) the vertices of the graph and we show that it needs only O( n 2) operations.
ISSN:0012-365X
1872-681X
DOI:10.1016/S0012-365X(00)00264-8