出典:Wikipedia
出典:『Wikipedia』 (2011/04/07 07:01 UTC 版)
In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, and containment graphs.