Badawi, Ayman; Rissner, Roswitha (De Gruyter, 2020)
For a partially ordered set(A, ≤), letGA be the simple, undirected graph with vertex set A such that two vertices a ≠ ∈ b A are adjacent if either a ≤ b or b a ≤ . We call GA the partial order graph or comparability graph ...