1. Incidence Coloring—Cold Cases
- Author
-
Kardoš, František, Maceková, Mária, Mockovčiaková, Martina, Sopena, Éric, and Soták, Roman
- Abstract
An incidencein a graph Gis a pair (v, e) where vis a vertex of Gand eis an edge of Gincident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (i) v= u, (ii) e= f, or (iii) edge vuis from the set {e, f}. An incidence coloringof Gis a coloring of its incidences assigning distinct colors to adjacent incidences. The minimum number of colors needed for incidence coloring of a graph is called the incidence chromatic number.
- Published
- 2020
- Full Text
- View/download PDF