![]() | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (February 2023) |
This article relies largely or entirely on a single source. (April 2024) |
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 where is a vertex and is an edge incident with
Two distinct incidences and are adjacent if and only if , or or .
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 once.