Why almost all k-colorable graphs are easy to color

Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Fingerprint

Dive into the research topics of 'Why almost all k-colorable graphs are easy to color'. Together they form a unique fingerprint.

Mathematics