Author:
Hujdurović Ademir,Milanič Martin,Ries Bernard
Funder
Slovenian Research Agency
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference42 articles.
1. Strong cliques and equistability of EPT graphs;Alcón;Discrete Appl. Math.,2016
2. When are chordal graphs also partition graphs?;Anbeek;Australas. J. Combin.,1997
3. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Inform. Process. Lett.,1979
4. Stochastic graphs and strongly perfect graphs—a survey;Berge;Southeast Asian Bull. Math.,1983
5. Strongly perfect graphs;Berge,1984
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong cliques in diamond-free graphs;Theoretical Computer Science;2021-02
2. Strong cliques in vertex‐transitive graphs;Journal of Graph Theory;2020-05-03
3. Strong Cliques in Diamond-Free Graphs;Graph-Theoretic Concepts in Computer Science;2020