Incidence Coloring—Cold Cases

Discussiones Mathematicae Graph Theory

Mockovčiaková Martina¹  Maceková Mária²  Soták Roman²  Kardoš František³  Sopena Éric³ 

[1] European Centre of Excellence NTIS, University of West Bohemia, Pilsen, Czech Republic;Institute of Mathematics, P.J. Šafárik University in Košice, Jesenná 5, 04001Košice, Slovakia;Univ. Bordeaux, Bordeaux INP, CNRS, LaBRI, UMR5800, F-33400 Talence, France;

关键词: incidence coloring;    incidence chromatic number;    planar graph;    maximum average degree;    05c15;   

DOI  :  10.7151/dmgt.2140

来源: DOAJ

【 摘 要 】

An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident 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 vu is from the set {e, f}. An incidence coloring of G is 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.

【 授权许可】

Unknown