restatement of Konig's theorem, and perfection of the line graphs themselves is a restatement of an earlier theorem of Konig, that every bipartite graph has an edge coloring using a number of colors equal to its maximum degree.

According to the strong perfect graph theorem, the perfect graphs have a forbidden graph characterization resembling that of bipartite graphs: a graph is bipartite