Author:
Bousquet Nicolas,Lagoutte Aurélie,Maffray Frédéric,Pastor Lucas
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Vertex elimination orderings for hereditary graph classes;Aboulker;Discrete Math.,2015
2. On the number of maximal independent sets in graphs from hereditary classes;Alekseev,1991
3. Some improved bounds on communication complexity via new decomposition of cliques;Amano;Discrete Appl. Math.,2014
4. The Erdős–Hajnal conjecture for long holes and antiholes;Bonamy;SIAM J. Discrete Math.,2016
5. Clique versus independent set;Bousquet;European J. Combin.,2014
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unambiguous DNFs and Alon–Saks–Seymour;SIAM Journal on Computing;2023-10-20
2. On the binary and Boolean rank of regular matrices;Journal of Computer and System Sciences;2023-06
3. Unambiguous DNFs and Alon-Saks-Seymour;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02