Before revision:  In this way we are able to determine complexity dichotomies for the aforementioned graph problems {\cal   .
After revision:  In this way we are able to determine complexity dichotomies for the aforementioned graph problems . Afterwards we perform a more refined width-parameter analysis, which shows even more clearly which width parameters are bounded for classes of{\cal .