A new upper bound for the chromatic number of a graph.

Ingo Schiermeyer

Published in: Discuss. Math. Graph Theory (2007)

Keyphrases

upper bound
small number
information systems
worst case
shortest path
constant factor
error probability
real time
data sets
neural network
information retrieval
random graphs