Publisher
Springer International Publishing
Reference21 articles.
1. Bharathi, A.P., Choudum, S.A.: Colouring of ($$P_3\cup P_2$$)-free graphs. Graphs Combin. 34(1), 97–107 (2018)
2. Blázsik, Z., Hujter, M., Pluhár, A., Tuza, Z.: Graphs with no induced $$C_4$$ and $$2K_2$$. Discrete Math 115(1–3), 51–55 (1993)
3. Brause, C., Randerath, B., Schiermeyer, I., Vumar, E.: On the chromatic number of $$2K_2$$-free graphs. Discrete Appl. Math 253, 14–24 (2019)
4. Chung, F.R., Gyárfás, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in $$2K_2$$-free graphs of bounded degree. Discrete Math 81(2), 129–135 (1990)
5. Dhanalakshmi, S., Sadagopan, N., Manogna, V.: On $$2K_2$$-free graphs-structural and combinatorial view, pp. 1–15 . arXiv preprint arXiv:1602.03802 (2016)