Author:
da Cruz Maria Luíza L.,Bravo Raquel S. F.,Oliveira Rodolfo A.,Souza Uéverton S.
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Achlioptas, D.: The complexity of G-free colourability. Discret. Math. 165–166, 21–30 (1997)
2. Agrawal, A., Gupta, S., Saurabh, S., Sharma, R.: Improved algorithms and combinatorial bounds for independent feedback vertex set. In: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)
3. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 14(4) (1982)
4. Bacsó, G., Tuza, Z.: Dominating cliques in $$P_5$$-free graphs. Period. Math. Hung. 21(4), 303–308 (1990)
5. Bang-Jensen, J., Bessy, S.: Degree-constrained 2-partitions of graphs. Theoret. Comput. Sci. 776, 64–74 (2019)