Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5

Electronic Journal Of Combinatorics

Daniel W. Cranston¹ 

关键词: Distinguishing chromatic number;    Automorphism;    Distinguishing coloring;    Girth 5;    Greedy coloring;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The distinguishing chromatic number, $\chi_D(G)$, of a graph $G$ is the smallest number of colors in a proper coloring, $\varphi$, of $G$, such that the only automorphism of $G$ that preserves all colors of $\varphi$ is the identity map.  Collins and Tren

【 授权许可】

Others