On r-hued colorings of graphs without short induced paths
Discrete Mathematics(2019)
摘要
For integers k,r>0, a (k,r)-coloring of a graph G is a proper coloring on the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{d(v),r} different colors. The r-hued chromatic number, denoted by χr(G), is the smallest integer k for which a graph G has a (k,r)-coloring. We prove the following:
更多查看译文
关键词
(k,r)-coloring,r-hued chromatic number,(r,s)-normal,P4-free graphs,P5-free graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络