Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Strongly perfect graphs;Berge,1984
2. A composition for perfect graphs;Bixby,1984
3. Graphical properties related to minimal imperfection;Bland;Discrete Math.,1979
4. Polynomial algorithm to recognize a Meyniel graph;Burlet,1984
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献