Assertion: graph's vertex | /r/HasProperty | incident
Facets:
value: to the edge
type: LOCATION
value: given an edge
type: OTHER
value: to an edge of each color
type: TRANSITIVE-OBJECT
value: adjacent to each other
type: OTHER
value: at a column
type: LOCATION
Source sentences:
text: The entries indicate whether the vertex at a row is incident to the edge at a column.
text: An edge and a vertex on that edge are called incident.
text: Two vertices, v and w, of a graph are ADJACENT if there is an edge, vx, joining theem; the vertices are then considered INCIDENT to the edge, vx.
text: For instance a 1 -factorization is an edge coloring with the additional property that each vertex is incident to an edge of each color.
text: An edge coloring of a graph is a proper coloring of the edges, meaning an assignment of colors to edges so that no vertex is incident to two edges of the same color.
text: Given an edge (u,v), the vertices u and v are said to be incident to the edge and adjacent to each other.