A linear algorithm for coloring vertices of a graph or finding a Meyniel obstruction - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2005

A linear algorithm for coloring vertices of a graph or finding a Meyniel obstruction

Benjamin Lévêque
Frédéric Maffray

Résumé

A Meyniel obstruction is an odd cycle with at most one chord and a graph is Meyniel if and only if it has no Meyniel obstruction. The authors have found in a previous work a linear-time algorithm for optimaly color the vertices of a Meyniel graph. Here we extend this algorithm to obtain a linear-time algorithm that, for any graph, colors optimally the vertices of the graph or finds a Meyniel obstruction.
Fichier principal
Vignette du fichier
ColObstruct.pdf (100.84 Ko) Télécharger le fichier

Dates et versions

hal-00008557 , version 1 (08-09-2005)
hal-00008557 , version 2 (25-10-2005)
hal-00008557 , version 3 (13-11-2007)

Identifiants

Citer

Benjamin Lévêque, Frédéric Maffray. A linear algorithm for coloring vertices of a graph or finding a Meyniel obstruction. 2005. ⟨hal-00008557v1⟩
103 Consultations
250 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More