A topological lower bound for the chromatic number of a special family of graphs.

Hamid Reza Daneshpajouh

Published in: Discret. Math. (2018)

Keyphrases

lower bound
upper bound
computational complexity
special case
small number
color information
objective function
random walk
constraint satisfaction problems
index structure
graph representation
topological features