Funder
Heilbronn Institute for Mathematical Research
Austrian Science Fund
Reference53 articles.
1. The complexity of G-free colourability;Achlioptas;Discrete Math.,1997
2. The existence of uniquely- g colourable graphs;Achlioptas;Discrete Math.,1998
3. Partitioning into graphs with only small components;Alon;J. Combin. Theory Ser. B,2003
4. Acyclic coloring of graphs;Alon;Random Structures Algorithms,1991
5. Polynomial time degrees of NP-sets;Ambos-Spies,1987
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献