Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. The effect of two cycles on the complexity of colourings by direct graphs;Bang-Jensen;Discrete Appl. Math.,1990
2. The complexity of colouring by semi-complete digraphs;Bang-Jensen;SIAM J. Discrete Math.,1988
3. Computers and Intractability;Garey,1979
4. W. Gutjhar, E. Welzl and G. Woeginger, Polynomial graph-colorings, Tech. Rept. B-88-06, University of Berlin.
5. On the complexity of H-colouring;Hell;J. Combin. Theory Ser. B,1990
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献