Author:
Bharathi Arpitha P.,Choudum Sheshayya A.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Arbib, C., Mosca, R.: On ($$P_5$$P5, diamond)-free graphs. Discrete Math. 250, 1–22 (2002)
2. Bermond, J.C., Bond, J., Paoli, M., Peyrat, C.: Surveys in Combinatorics. Proceedings of the Ninth British Combinatorics Conference, Lecture Notes Series, vol. 82 (1983)
3. Blázsik, Z., Hujter, M., Pluhár, A., Tuza, Z.: Graphs with no induced $$C_4$$C4 and $$2K_2$$2K2. Discrete Math. 115, 51–55 (1993)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, Berlin (2008)
5. Brandstädt, A.: ($$P_{5}$$P5, diamond)-free graphs revisited: structure and linear time optimization. Discrete Appl. Math. 138, 13–27 (2004)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献