A Class of Perfect Graphs Containing P6

Let P₆ denote the induced path on six nodes. We prove that if a perfect graph G contains P6 as an induced subgraph but not two families introduced by Conforti and Cornuéjols then G is bipartite or disconnected, or Ḡ has a star cutset.