Concept
Incidence (graph)
An incidence graph is a Levi graph. 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 either the vertices or the edges are adjacent, which is the case if one of the following holds: and and or , and 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.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.