Author:
Golumbic Martin C.,Maffray Frédéric,Morel Grégory
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference24 articles.
1. Berry, A., Golumbic, M. C., & Lipshteyn, M. (2004). Two tricks to triangulate chordal probe graphs in polynomial time. In Proc. SODA’04, 962–969.
2. Berry, A., Golumbic, M. C., & Lipshteyn, M. (2007). Cycle-bicolorable graphs and triangulating chordal probe graphs. SIAM Journal on Discrete Mathematics, 21, 573–591.
3. Brandstädt, A., Le, V., & Spinrad, J. P. (1999) Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
4. Chandler, D. D., Chang, M.-S., Kloks, T., Le, V. B., & Peng, S.-L. (2008). Probe Ptolemaic graphs. In Proc. COCOON 2008. Lecture notes in computer science (Vol. 5092, pp. 468–477).
5. Chang, M.-S., Kloks, T., Kratsch, D., Liu, J., & Peng, S.-L. (2005). On the recognition of probe graphs of some self-complementary classes of perfect graphs. In Proc. COCOON 2005. Lecture notes in computer science (Vol. 3595, pp. 808–817).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献