Before revision:  We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
After revision:  We present a new parallel algorithm for k-clique counting that has polylogarithmic span and is work-efficient (matches the work of the best sequential algorithm) for sparse graphs .