In graph theory, a vertex is incident with an edge if the vertex is one of the two vertices the edge connects.
An incidence is a pair
is an edge incident with
An incidence coloring of a graph
is an assignment of a color to each incidence of G in such a way that adjacent incidences get distinct colors.
It is equivalent to a strong edge coloring of the graph obtained by subdivising each edge of
This graph theory-related article is a stub.
You can help Wikipedia by expanding it.