Even Pairs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2001

Even Pairs

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


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.


Other [cs.OH]
Not file

Dates and versions

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


  • HAL Id : inria-00100553 , version 1


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⟩
50 View
0 Download


Gmail Facebook Twitter LinkedIn More