Abstract
We present efficient algorithms for determining if the chromatic number of an input graph is close to Δ. Our results are obtained via the probabilistic method.
Cite
CITATION STYLE
APA
Molloy, M., & Reed, B. (1998). Colouring graphs whose chromatic number is almost their maximum degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 216–225). Springer Verlag. https://doi.org/10.1007/bfb0054323
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free