We obtained refined enumeration formulas for partial
matchings and even trees in connection with the
lattice polynomials introduced by Hough and Shapiro.
The key contributions are the notions of 
crossings for partial matchings and the r-index
of even trees, which leads to the formulas 
given by the refined 3-Catalan numbers $T_{n,k}$.