Login / Signup
A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.
Romain Absil
Eglantine Camby
Alain Hertz
Hadrien Mélot
Published in:
Discret. Appl. Math. (2018)
Keyphrases
</>
maximum number
lower bound
upper bound
high quality
objective function
search algorithm
computational complexity
small number
memory requirements
branch and bound algorithm
graph model
graph theoretic
random graphs
maximum distance