Bound graph
id:
bound-graph-272-3046494
title:
Bound graph
text:
In graph theory, a bound graph expresses which pairs of elements of some partially ordered set have an upper bound. Rigorously, any graph G is a bound graph if there exists a partial order ≤ on the vertices of G with the property that for any vertices u and v of G, uv is an edge of G if and only if u ≠ v and there is a vertex w such that u ≤ w and v ≤ w. The bound graphs are exactly the graphs that have a clique edge cover, a family of cliques that cover all edges, with the additional property t
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bound_graph
date created:
date modified:
2024-01-25T01:59:37Z
main entity:
{"identifier":"Q4949882","url":"https://www.wikidata.org/entity/Q4949882"}
image:
fields total:
13
integrity:
13