Induced Colorful Trees and Paths in Large Chromatic Graphs

[摘要] In a proper vertex coloring of a graph a subgraph is colorful if its vertices are colored with different colors. It is well-known (see for example in Gyárfás (1980)) that in every proper coloring of a $k$-chromatic graph there is a colorful path $P_k$ on

[学科分类] 离散数学和组合数学

[关键词] Induced subgraphs;Graph colorings