Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Finding maximum cliques in circular-arc graphs;Apostolico;Inform. Process. Lett.,1987
2. Finding Hamiltonian circuits in proper interval graphs;Bertossi;Inform. Process. Lett.,1983
3. Hamiltonian circuits in interval graph generalizations;Bertossi;Inform. Process. Lett.,1986
4. ACHROMATIC NUMBER is NP-complete for cographs and interval graphs;Bodlaender,1988
5. Dominating sets and domatic number of circular arc graphs;Bonuccelli;Discrete Appl. Math.,1985
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献