Comparability graph
id:
comparability-graph-284-6463211
title:
Comparability graph
text:
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, containment graphs, and divisor graphs.
An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph linking pairs of comparable elements in a partial order
original url:
https://en.wikipedia.org/wiki/Comparability_graph
date created:
date modified:
2024-01-25T01:41:25Z
main entity:
{"identifier":"Q5155607","url":"https://www.wikidata.org/entity/Q5155607"}
image:
fields total:
13
integrity:
14