Honeycomb meshes are topological structures for connecting processors within parallel computers. The unicast routing strategy on honeycomb meshes are studied. It is indicated that a previous known routing algorithm may suffer from deadlock. A deadlock-free routing algorithm known as the XYZ-ROUTE algorithm is presented by employing the classical virtual channel technique. This algorithm is improved to make it work properly in the presence of convex faults.