Achievable error exponents for the relay channel are derived using the method of types. In particular, two blockMarkov coding schemes are analyzed: partial decode-forward and compress-forward. The derivations require combinations of the techniques in the proofs of the packing lemma for the error exponent of channel coding and the covering lemma for the error exponent of source coding with a fidelity criterion.