paper

Quasiperfect graph

arXiv:2208.14894

Abstract

A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.

4 pages, delete theorem 3 and add some explain in further remarks

Quasiperfect graph · wovepaper