Login / Signup
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs.
Van H. Vu
Published in:
J. Graph Theory (1999)
Keyphrases
</>
random graphs
upper bound
graph theoretic
lower bound
computational complexity
objective function
search space
constraint satisfaction problems
learning curves