We establish a property of minimal imperfect graphs, and use this property to generate two classes of perfect graphs. The first class contains all comparability graphs, all triangulated graphs, and two other classes of perfect graphs. The second class contains all triangulated graphs and all line-graphs of bipartite graphs.