Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Perfect Graph

    Definition

    A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., ω(G) = χ(G). A graph that is not a perfect graph is called an imperfect graph. A graph for which ω(G) = χ(G) (without any requirement that this condition also hold on induced subgraphs) is called a weakly perfect graph. All perfect graphs are therefore weakly perfect by definition.

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.