For each fixed number , it is possible to decide in polynomial time whether the subchromatic number of interval and permutation graphs is at most r .
For every fixed integer r , it is possible to decide in polynomial time whether the subchromatic number of interval and permutation graphs is at most r .