\(P_4\)-domination in minimal imperfect graphs (Q1293209): Difference between revisions

A graph is said to be perfect if, for any of its induced subgraphs, the chromatic number equals the clique number. It is called minimal imperfect if it is not perfect, but all its proper induced subgraphs are. The author introduces the notion of \(P_4\)-domination and studies the relation between \(P_4\)-domination and the perfectness and graphs. Two conjectures are given. They are used to find an equivalent version of the odd pair conjecture. The author proves some particular cases of these conjectures.