Author:
Chiarelli Nina,Martínez-Barona Berenice,Milanič Martin,Monnot Jérôme,Muršič Peter
Publisher
Springer International Publishing
Reference38 articles.
1. Alcón, L., Gutierrez, M., Kovács, I., Milanič, M., Rizzi, R.: Strong cliques and equistability of EPT graphs. Discret. Appl. Math. 203, 13–25 (2016)
2. Alcón, L., Gutierrez, M., Milanič, M.: A characterization of claw-free CIS graphs and new results on the order of CIS graphs. Electron. Notes Theoret. Comput. Sci. 346, 15–27 (2019)
3. Alekseev, V.E.: On the number of maximal independent sets in graphs from hereditary classes. In: Combinatorial-Algebraic Methods in Discrete Optimization, pp. 5–8. University of Nizhny Novgorod (1991). (in Russian)
4. Andrade, D.V., Boros, E., Gurvich, V.: Not complementary connected and not CIS $$d$$-graphs form weakly monotone families. Discret. Math. 310(5), 1089–1096 (2010)
5. Springer Optimization and Its Applications;DV Andrade,2018
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong cliques in diamond-free graphs;Theoretical Computer Science;2021-02