Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Seminaire MSH;Berge,1983
2. Perfect graphs are kernel solvable;Boros;DIMACS Technical Report,1994
3. College admissions and the stability of marriage;Gale;Amer. Math. Monthly,1962
4. A characterization of perfect graphs;Lovász;J. Combin. Theory Ser. B,1972
5. On kernels ini;Maffray;Discrete Math.,1986
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献