| has gloss | eng: In areas of mathematics influenced by graph theory, a permutation graph is the intersection graph of a family of line segments that connect two parallel lines in the Euclidean plane. Equivalently, given a permutation (σ1,σ2,σ3,...) of the numbers 1,2,3,...n, a permutation graph has a vertex for each number 1,2,3,...n and an edge between any two numbers that are in reversed order in the permutation. A permutation graph has a unique representation if and only if it is prime with respect to the split decomposition. |
