Login / Signup
An upper bound for the total chromatic number of dense graphs.
H. R. Hind
Published in:
J. Graph Theory (1992)
Keyphrases
</>
upper bound
lower bound
small number
neural network
feature selection
search algorithm
computational complexity
object recognition
color images
color information
random graphs