1. Labeling bipartite permutation graphs with a condition at distance two;Araki;Discrete Appl. Math.,2009
2. A. Bouchet, Etude Combinatoire des ordonnés finis-applications, Thèse, Université Scientifique et Medicale de Grenoble, 1971.
3. Graph Classes: A Survey;Brandstädt,1999
4. On the linear structure and clique-width of bipartite permutation graphs;Brandstädt;Ars Combin.,2003
5. An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs;Chao;Discrete Appl. Math.,2000