On permutation labeling
M. A. Seoud, M. A. Salim · Journal of the Egyptian Mathematical Society · 2011
We determine all permutation graphs of order ⩽9. We prove that every bipartite graph of order ⩽50 is a permutation graph. We convert the conjecture stating that “every tree is a permutation graph” to be “every bipartite graph is a permutation graph”.