Even Pairs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Chapitre D'ouvrage Année : 2001

Even Pairs

Celina M. H. de Figueiredo
  • Fonction : Auteur
Claudia Linhares Sales
  • Fonction : Auteur
Frederic Maffray
Oscar Porto
  • Fonction : Auteur
Bruce Reed

Résumé

Two nonadjacent vertices x and y in a graph G form an even pair if every induced path between them has an even number of edges. Even pairs have become an imprtant tool for proving that certain classes of graphs are perfect and for designing optimization algorithms on special classes of perfect graphs. This chapter surveys results of these types.It also discusses numerous related concepts including odd pairs.

Domaines

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

Dates et versions

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

Identifiants

  • HAL Id : inria-00100553 , version 1

Citer

Hazel Everett, Celina M. H. de Figueiredo, Claudia Linhares Sales, Frederic Maffray, Oscar Porto, et al.. Even Pairs. Jorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization. ⟨inria-00100553⟩
68 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More