  The literature on quaternionic polynomials and, in particular, on methods for
determining and classifying their zero-sets, is fast developing and reveals a
growing interest on this subject. In contrast, polynomials defined over the
algebra of coquaternions have received very little attention from researchers.
One of the few exceptions is the very recent paper by Janovsk\'a and Opfer
[Electronic Transactions on Numerical Analysis, Volume 46, pp. 55-70, 2017],
where, among other results, we can find a first attempt to prove that a
unilateral coquaternionic polynomial of degree $n$ has, at most, $n(2n-1)$
zeros.
  In this paper we present a full proof of the referred result, using a totally
different and, from our point of view, much simpler approach. Also, we give a
complete characterization of the zero-sets of such polynomials and present a
new result giving conditions which guarantee the existence of a special type of
zeros. An algorithm to compute and classify all the zeros of a coquaternionic
polynomial is proposed and several numerical examples are carefully
constructed.
