Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference10 articles.
1. Bayer, D., Le, V. B., & de Ridder, E. (2009). Probe threshold graphs and probe trivially perfect graphs. Theoretical Computer Science, 410, 4812–4822.
2. Brandstädt, A., Le, V. B., & Spinrad, J. P. (1999). Graph classes: a survey. SIAM monographs on discrete mathematics and applications. Philadelphia: SIAM.
3. Cohen, E., Golumbic, M. C., Lipshteyn, M., & Stern, M. (2010). On the bi-enhancement of chordal-bipartite probe graphs. Information Processing Letters, 110, 193–197.
4. Golumbic, M. C. (1980). Algorithmic graph theory and perfect graphs. New York: Academic Press. Second edition: Annals of discrete math. 57. Amsterdam: Elsevier (2004).
5. Golumbic, M. C., Kaplan, H., & Shamir, R. (1995). Graph sandwich problems. Journal of Algorithms, 19, 449–473.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献