Our paper is organized as follows. This is clearly a disadvantage although it is a quite natural assumption. 2 CCPO and the 2 sweep LexBFS will be introduced in the next section. A bipartite permutation graph is both a bipartite graph and a permutation graph. This class of graphs was studied by Spinrad et al.
G is a bipartite permutation graph.
There is a strong ordering of S and T . J. Spinrad, A. Brandstadt and L. Stewart, Bipartite permutation graphs , Discrete Appl. J. Spinrad, A. Brandstadt, and L. Stewart. Bipartite permutation graphs . Recently, Bodlaender presented a linear time algorithm to decide whether the treewidth of a graph is larger than some fixed constant k.