Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski. The smallest hard-to-color graph for algorithm DSATUR. Discrete Mathematics, 236(1-3):151-165, 2001. [doi]
@article{JanczewskiKMP01,
title = {The smallest hard-to-color graph for algorithm DSATUR},
author = {Robert Janczewski and Marek Kubale and Krzysztof Manuszewski and Konrad Piwakowski},
year = {2001},
doi = {10.1016/S0012-365X(00)00439-8},
url = {http://dx.doi.org/10.1016/S0012-365X(00)00439-8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/JanczewskiKMP01},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {236},
number = {1-3},
pages = {151-165},
}