On the complexity of recognizing decomposable perfect graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2000

On the complexity of recognizing decomposable perfect graphs

Abstract

Chvátal, Lenhart and Sbihi identified six classes of graphs that are perfect if and only if two subgraphs induced by a specific colouring of the vertices are perfect. It is well-known that one of these classes is recognizable in polynomial time. We prove that the recognition of the five other classes is NP-complete.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00099295 , version 1

Cite

Cristina Bazgan, Laurent Juban. On the complexity of recognizing decomposable perfect graphs. [Intern report] A00-R-084 || bazgan00a, 2000, 13 p. ⟨inria-00099295⟩
151 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More