Assertion: graph's number | /r/HasProperty | equal
Facets:
value: to 2
type: OTHER
value: to the number of edges
type: OTHER
Source sentences:
text: Two graph G and H are isomorphic if H can be obtained from G by relabeling the vertices - that is, if there is a one-to-one correspondence between the vertices of G and those of H, such that the number of edges joining any pair of vertices in G is equal to the number of edges joining the corresponding pair of vertices in H.
text: The number of acyclic orientations is equal to
text: i.e. its chromatic number is less than or equal to 2).