Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. The effect of local constraints on the complexity of determination of the graph independence number;Alekseev,1982
2. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004
3. The complexity of surjective homomorphism problems - a survey;Bodirsky;Discrete Appl. Math.,2012
4. Acyclic, star and injective colouring: a complexity picture for H-free graphs;Bok,2021
5. Independent feedback vertex sets for graphs of bounded diameter;Bonamy;Inf. Process. Lett.,2018