Simple Proofs of Results on Paths Representing All Colors in Proper Vertex-Colorings

被引：0
作者：
Chiang Lin
机构：
[1] National Central University,Department of Mathematics
来源：
Graphs and Combinatorics | 2007年 / 23卷
关键词：
Vertex-coloring; Colorful path; Path representing all colors;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this note we give simple proofs of two results which concerns paths representing all colors in optimal proper vertex-colorings of graphs. One result, due to Fung [2], is about the existence of colorful paths. The other one, due to Li [4], is about the existence of paths starting at any given vertex and representing all colors. Besides, we propose some open problems.
引用
收藏
页码：201 / 203
页数：2
相关论文
共 3 条
  • [1] Fung T.-S.(1989)A colorful path The Mathematical Gazette 73 186-188
  • [2] Li H.(2001)A generalization of the Gallai-Roy Theorem Graphs and Combinatorics 17 681-685
  • [3] Roy B.(1967)Nombre chromatique et plus longs chemins d'un graph Rev. AFIRO 1 127-132
1