Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. Composition of Graphs and Polyhedra II: Stable Sets;Barahona,1987
2. Polytopes des indépendants d'un graph série-parallèle;Boulala;Discrete Math.,1979
3. On certain polytopes associated with graphs;Chvátal;J. Combin. Theory Ser. B,1975
4. A primal algorithm for optimal matching;Cunningham;Math. Programming Stud.,1978
5. Planar 3DM is NP-complete;Dyer;J. Algorithms,1986
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complementation in T-perfect Graphs;Graph-Theoretic Concepts in Computer Science;2021
2. $t$-Perfection in $P_5$-Free Graphs;SIAM Journal on Discrete Mathematics;2017-01
3. Packing and covering with linear programming: A survey;European Journal of Operational Research;2013-06
4. A simpler proof for the two disjoint odd cycles theorem;Journal of Combinatorial Theory, Series B;2013-05
5. t-Perfection Is Always Strong for Claw-Free Graphs;SIAM Journal on Discrete Mathematics;2010-01