{"version":"1.0","type":"link","title":"Comparability graph - Newikis","description":"In graph theory and order 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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}