Login / Signup
A general upper bound for the cyclic chromatic number of 3-connected plane graphs.
Hikoe Enomoto
Mirko Hornák
Published in:
J. Graph Theory (2009)
Keyphrases
</>
upper bound
special case
small number
finite number
social networks
image processing
computational complexity
lower bound
maximum number
data mining
data structure
color images
worst case
closely related
fixed number
connected graphs