@article{EvelyneFlandrin2017,
abstract = {A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = \{1, . . . , k\}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.},
author = {Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Woźniak},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {general edge coloring; total coloring; neighbor-distinguishing index; neighbor sum distinguishing coloring},
language = {eng},
number = {1},
pages = {29-37},
title = {A Note on Neighbor Expanded Sum Distinguishing Index},
url = {http://eudml.org/doc/287981},
volume = {37},
year = {2017},
}
TY - JOUR
AU - Evelyne Flandrin
AU - Hao Li
AU - Antoni Marczyk
AU - Jean-François Saclé
AU - Mariusz Woźniak
TI - A Note on Neighbor Expanded Sum Distinguishing Index
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 1
SP - 29
EP - 37
AB - A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.
LA - eng
KW - general edge coloring; total coloring; neighbor-distinguishing index; neighbor sum distinguishing coloring
UR - http://eudml.org/doc/287981
ER -
