Quasiperfect graph
From MaRDI portal
Publication:6409366
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.
This page was built for publication: Quasiperfect graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409366)
