Before revision:  We also show how to use }  the same approach  to obtain quasi-polynomial-time algorithms for related problems, including Maximum Weight Induced Matching and 3-Coloring , in P_t-free and C_{>t .
After revision:  We also show how to use } the same approach to obtain quasi-polynomial-time algorithms for related problems, including Maximum Weight Induced Matching and 3-Coloring .