论文标题
Quasiperfect图
Quasiperfect graph
论文作者
论文摘要
完美的图是一个图形，每个诱导子图的集合数等于色数。在本文中，我将介绍一个新的图形系列，即概括完美图的准式图图。
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.
