一个图补图是完美图本身也是完美图。最初被称为弱完美图猜想 (Fulkerson 1971)，该结果随后被 Lovász (1972) 证明，并因此被称为完美图定理 (Skiena 1990, p. 219; Cornuéjols 2002)。
完美图定理
另请参阅
完美图, 强完美图定理使用 探索
参考文献
Cornuéjols, G. "The Strong Perfect Graph Conjecture." International Congress of Mathematics, Beijing, China, 2002, Vol. 3. pp. 547-559. http://integer.gsia.cmu.edu/webpub/SPGCsurvey.pdf.Fulkerson, D. R. "Blocking and Anti-Blocking Pairs of Polyhedra." Math. Program. 1, 168-194, 1971.Lovász, L. "Normal Hypergraphs and the Perfect Graph Conjecture." Disc. Math. 2, 253-267, 1972.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.West, D. B. "The Perfect Graph Theorem." Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, pp. 226 and 320-323, 2000.在 中被引用
完美图定理请这样引用
Weisstein, Eric W. “完美图定理。” 来自 —— 资源。 https://mathworld.net.cn/PerfectGraphTheorem.html