Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

A self-complementary graph is isomorphic to its (edge) complement. My question is whether finding a maximum cardinality independent set remains hard on this class of graphs. It is known that for some sub-classes of self-complementary graphs the problem becomes in P but I couldn't find anything regarding the more general question.

Thanks!

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.