Well-Covered Graph Checker

About Well-Covered Graph Checker

A well-covered graph checker testing if all maximal independent sets have equal size. K_n: well-covered (size 1). C_{2k}: well-covered (size k). C_{2k+1}: NOT well-covered. co-NP-complete in general but polynomial for special classes. Client-side.

Well-Covered Graph Checker Features

• Well-covered test
• MIS sizes
• α comparison
• Special classes
• Common graphs