build upon the equivalence between the PDTC problem and the bounded coloring (BC) problem on permutation graphs: for the … graphs. To the contrary, the BC problem is known to be hard on permutation graphs when h >= 6 is a fixed constant, but s is … problem can be solved in polynomial time when s is a fixed constant on co-comparability graphs, a superclass of permutation …

frameworks which motivate this problem in interval and permutation graphs: the inverse booking problem and the inverse track … problem in permutation graphs; we show how to solve in polynomial time a generalization of the problem with a bounded number …