Skip to Main content Skip to Navigation
Theses

Coloration de graphes : structures et algorithmes

Benjamin Lévêque 1
1 OC
Leibniz - IMAG - Laboratoire Leibniz
Abstract : Many applied problems can be modelised by the vertex coloring problem of a graph, which is NP-complete in general but polynomial on the class of perfect graphs introduced by Berge. The coloring algorithm of perfect graphs, due to Grötschel, Lovasz and Schrijver, is not really efficient in practice and it is still interesting to find a ''purely'' combinatorial algorithm to color perfect graphs in polynomial time. In this thesis, we give several simple and fast algorithms that enable to color some subclasses of perfect graphs. These algorithms use in particular the notion of even pair contraction, introduced by Fonlupt and Uhry, about which several conjectures are still open. We also use search algorithms like LexBFS, due to Rose, Tarjan and Lueker, to prove some structural results on the considered graphs.
Document type :
Theses
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00187797
Contributor : Benjamin Lévêque <>
Submitted on : Thursday, November 15, 2007 - 11:54:44 AM
Last modification on : Monday, November 9, 2020 - 5:06:03 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:17:56 AM

Identifiers

  • HAL Id : tel-00187797, version 1

Collections

IMAG | CNRS | G-SCOP | UJF | INSMI | UGA

Citation

Benjamin Lévêque. Coloration de graphes : structures et algorithmes. Mathématiques [math]. Université Joseph-Fourier - Grenoble I, 2007. Français. ⟨tel-00187797⟩

Share

Metrics

Record views

2187

Files downloads

7272