On the maximum q-colourable induced subgraph problem in perfect graphs

Nicola Apollonio and Massimiliano Caramia

International Journal of Mathematics in Operational Research, 2010, vol. 2, issue 1, 1-16

Abstract: Given a non-negative integer q, the maximum q-colourable induced subgraph (MCS) problem asks for an induced subgraph of maximum order among those that are q-colourable. By a result of Yannakakis and Gavril and independently of Corneil and Fonlupt, the MCS is NP-Complete even if restricted to the class of split graphs. In this paper, we investigate the approximability of the MCS problem in the class of perfect graphs.

Keywords: greedy algorithms; perfect graphs; vertex colouring; q-colourable; subgraphs. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=29686 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:2:y:2010:i:1:p:1-16

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().