An exact upper bound on the size of minimal clique covers. - Ryan McIntyre; Michael Soltys (CoRR, 2017)

An improved upper bound and algorithm for clique covers. - Ryan McIntyre; Michael Soltys (J. Discrete Algorithms, 2018)