Author:
Huang Shenwei,Johnson Matthew,Paulusma Daniël
Publisher
Oxford University Press (OUP)
Reference30 articles.
1. Huang S. , Johnson M. , Paulusma D. (2014) Narrowing the Complexity Gap for Colouring $(C_s,P_t)$ -Free Graphs. Proc. AAIM 2014, Vancouver, Canada, July 8–11. Lecture Notes in Computer Science 8546, pp. 162–173. Springer, Berlin, Heidelberg.
2. Lovász L. (1973) Coverings and Coloring of Hypergraphs. Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, March 5–8, pp. 3–12. Utilitas Mathematica Publishing, Winnipeg.
3. Vertex Colouring and Forbidden Subgraphs ? A Survey
4. Graph colorings with local constraints -- a survey
5. Golovach P.A. , Johnson M. , Paulusma D. , Song J. (2015) A survey on the computational complexity of colouring graphs with forbidden subgraphs. Manuscript, arXiv:1407.1482v4.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献