Answers are grounded in this paper and cite their sources.
A graph G with vertex set N = {1, 2, .-. , n} is called a permutation graph there exists a permutation P on N such that for i,j E N, (i -j)[P-'(i) -P-'(j)] < 0 if ar only if i and j are joined by an edge in G.
No takes yet. Share an insight, caveat, or question.
Even et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: