Author:
Hell Pavol,Mishra Aurosish
Funder
NSERC
ERCCZ LL 1201 Cores
MITACS Globalink Internship Program
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. The complexity of colouring by semicomplete digraphs;Bang-Jensen;SIAM J. Discrete Math.,1988
2. Graphs, polymorphisms and the complexity of homomorphism problems;Barto,2008
3. On coloring the nodes of a network;Brooks;Math. Proc. Cambridge Philos. Soc.,1941
4. Uniquely colourable graphs and the hardness of colouring graphs of large girth;Emden-Weinert;Combin. Probab. Comput.,1998
5. List homomorphisms of graphs with bounded degrees;Feder;Discrete Math.,2007