Before revision:  Combined with known graph matching algorithms, our structural property also implies an exact algorithm and algorithms with worst case (1+\epsilon)-approximation guarantees in the special case of forests, where \lambda=1.
After revision:  Combined with known graph matching algorithms, our structural property also implies an exact algorithm and algorithms with worst case (1+\epsilon)-approximation guarantees in the special case of forests, where \lambda=1.