Recognizing Perfect 2-Split Graphs

A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which induces a split graph. We show that the strong perfect graph conjecture is true for 2-split graphs and we design a polynomial algorithm to recognize a perfect 2-split graph. Key words. graph coloring, perfect graph AMS subject classification. 05C15 PII. S0895480197329089

• Type: Journal
• Year: 2000
• Where: SIAMDM
• Authors: Chính T. Hoàng, Van Bang Le
• Keywords: Perfect Graph, SIAMDM 2000, Split Graph, Strong Perfect Graph Conjecture