Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. Restricted colorings of graphs;Alon,1993
2. The complexity of surjective homomorphism problems - a survey;Bodirsky;Discrete Appl. Math.,2012
3. Three-coloring and list three-coloring of graphs without induced paths on seven vertices;Bonomo;Combinatorica,2018
4. Three complexity results on coloring Pk-free graphs;Broersma;European J. Combin.,2013
5. M. Chudnovsky, Coloring graphs with forbidden induced subgraphs, in: Proc. ICM 2014, Vol. IV, 2014, pp. 291–302.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献