State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound.
@article{arxiv.1310.7741,
title = {Greedy Graph Colouring is a Misleading Heuristic},
author = {Ciaran McCreesh and Patrick Prosser},
journal= {arXiv preprint arXiv:1310.7741},
year = {2013}
}