Author:
Coja-Oghlan Amin,Kuhtz Lars
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference14 articles.
1. The chromatic number of random graphs;Bollobás;Combinatorica,1988
2. Random Graphs;Bollobás,2001
3. The Lovász number of random graphs;Coja-Oghlan;Combin. Probab. Comput.,2005
4. MAX k-CUT and approximating the chromatic number of random graphs;Coja-Oghlan;Random Structures Algorithms,2006
5. Exact and approximative algorithms for coloring G(n,p);Coja-Oghlan;Random Structures Algorithms,2004
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Memory Allocation Problems in Embedded Systems;2013-03-04
2. [r,s,t]-coloring of trees and bipartite graphs;Discrete Mathematics;2010-01