Locally Identifying Coloring of Graphs

Electronic Journal Of Combinatorics

Louis Esperet¹ 

关键词: Graph theory;    Coloring;    Identifying code;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring $c$ of a graph $G$ is said to be locally identifying, if for any adjacent vertices $u$ and $v$ with distinct closed neighborhoods, the sets of colors that appear

【 授权许可】

Others