On permutation graphs
M. A. Seoud, A. E. A. Mahran · Journal of the Egyptian Mathematical Society · 2012
We give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence of these necessary conditions. We show that they are altogether not sufficient for a graph to be a permutation graph.