Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Some classes of perfect graphs;Berge,1967
2. A decomposition theorem for partially ordered sets;Dilworth;Ann. of Math.,1950
3. On rigid circuit graphs;Dirac;Abh. Math. Sem. Univ. Hamburg,1961
4. Paths, trees, and flowers;Edmonds;Canad. J. Math.,1965
5. Maximum matching and a polyhedron with (0, 1)-vertices;Edmonds;J. Res. Nat. Bur. Standards Sect. B,1965
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献