Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind;Berge;Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe,1961
2. Blocking and anti-blocking paris of polyhedra;Fulkerson,1970
3. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math., in press.
Cited by
267 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The optimal χ-bound for (P7,C4,C5)-free graphs;Discrete Mathematics;2024-07
2. Generalized non-coprime graphs of groups;Journal of Algebraic Combinatorics;2024-04-01
3. Hitting all maximum stable sets in P5-free graphs;Journal of Combinatorial Theory, Series B;2024-03
4. Detecting $$K_{2,3}$$ as an Induced Minor;Lecture Notes in Computer Science;2024
5. A Sum of Squares Characterization of Perfect Graphs;SIAM Journal on Applied Algebra and Geometry;2023-10-16