citation Established by McKay & Radziszowski (1995) via a large exhaustive computer search over (4,5)-good graphs, showing none exists on 25 vertices while a 24-vertex coloring witnesses the lower bound. Survey DS1 section 2.1(i) cites the upper bound as [MR4]; the full set of 352366 critical graphs was later computed (2016).