Login / Signup
Colouring graphs when the number of colours is almost the maximum degree.
Michael Molloy
Bruce A. Reed
Published in:
J. Comb. Theory, Ser. B (2014)
Keyphrases
</>
maximum number
small number
computational complexity
pairwise
memory requirements
real time
databases
feature selection
decision trees
random graphs