Funder
Fundação de Amparo à Pesquisa do Estado de São Paulo
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Contentment in graph theory: Covering graphs with cliques;Orlin;Indag. Math. (Proc.),1977
2. Covering edges by cliques with regard to keyword conflicts and intersection graphs;Kou;Commun. ACM,1978
3. The approximation of maximum subgraph problems;Lund,1993
4. Algorithmic aspects of the intersection and overlap numbers of a graph;Hermelin,2012
5. The representation of a graph by set intersections;Erdős;Canad. J. Math.,1966
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献