Bull-Reducible Berge Graphs are Perfect - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

Bull-Reducible Berge Graphs are Perfect

Celina de Figueiredo
  • Fonction : Auteur
Sulamita Klein
  • Fonction : Auteur
Bruce Reed

Résumé

Berge's well known SPGC (Strong Perfect Graph Conjecture) states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. We prove that every bull-reducible Berge graph is perfect and we exhibit a polynomial-time recognition algorithm for bull-reducible Berge graphs.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

inria-00100577 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00100577 , version 1

Citer

Hazel Everett, Celina de Figueiredo, Sulamita Klein, Bruce Reed. Bull-Reducible Berge Graphs are Perfect. Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p. ⟨inria-00100577⟩
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More