Login / Signup
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices.
Jonathan A. Noel
Douglas B. West
Hehui Wu
Xuding Zhu
Published in:
Eur. J. Comb. (2015)
Keyphrases
</>
graph mining
random graphs
small number
worst case
undirected graph
maximum number
data structure
search algorithm
computational complexity
lower bound
graphical models
weighted graph
fixed number
randomized algorithm