Login / Signup
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number.
Arash Ahadi
Ali Dehghan
Published in:
CoRR (2009)
Keyphrases
</>
upper bound
small number
lower bound
data sets
data mining
real time
information retrieval
computational complexity
probabilistic model
fixed number
maximum number