On the maximum q-colourable induced subgraph problem in perfect graphs
by Nicola Apollonio, Massimiliano Caramia
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 1, 2010

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.

Online publication date: Tue, 01-Dec-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com