Three new families of perfect graphs have given various generalizations of known results: the weakly triangulated graphs, introduced by Hayward.
People also ask
What are the subclasses of perfect graphs?
What makes a perfect graph?
How to check if a graph is perfect?
What is the chromatic number of a perfect graph?
Oct 6, 2006 · Many classes of perfect graphs are, therefore, subclasses of other classes of perfect graphs. ... Skeletal graphs—a new class of perfect graphs.
Oct 22, 2024 · It has led to the definitions and study of many new classes of graphs for which the strong perfect graph conjecture has been verified.
Feb 28, 2003 · In many cases new classes of perfect graphs that have been introduced were motivated by generalizing known classes of perfect graphs. Many ...
A new algorithm for coloring perfect graphs is presented and used to color the parity orderable graphs, a class which strictly contains parity graphs, ...
A graph is perfect if for all induced subgraphs H: \chi(H) = \omega(H), where \chi is the chromatic number and \omega is the size of a maximum clique.
Chair-Free Berge Graphs Are Perfect · Split-Perfect Graphs: Characterizations and Algorithmic Use · Partial characterizations of clique-perfect graphs I: ...
Seinsche [1974] proved that P-free graphs are perfect. The main contribution of this thesis is the introduction of two new classes of Berge graphs, together ...
The bipartite graphs, their complements, and the line graphs of bipartite graphs and their complements form four basic classes of perfect graphs that play a ...
To summarize, in this section we have introduced four basic classes of perfect graphs: bipartite graphs and their complements, and. ⚫ line graphs of bipartite ...