Login / Signup
Upper bounds for the chromatic number of a graph.
Ingo Schiermeyer
Published in:
Electron. Notes Discret. Math. (2006)
Keyphrases
</>
upper bound
neural network
computational complexity
lower bound
small number
maximum number
knapsack problem
graph model
worst case
directed acyclic graph
lower and upper bounds
graph theoretic