TL;DR
This paper introduces quasiperfect graphs, a new family that generalizes perfect graphs, expanding the understanding of graph classes with specific coloring and clique properties.
Contribution
The paper defines quasiperfect graphs, extending the class of perfect graphs and exploring their properties and implications.
Findings
Quasiperfect graphs generalize perfect graphs.
Properties of quasiperfect graphs are characterized.
Potential applications in graph coloring and optimization.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research