@article{oai:muroran-it.repo.nii.ac.jp:00010259,
 author = {髙岡, 旭 and TAKAOKA, Asahi and OKUMA, Shingo and 大熊, 慎吾 and TAYU, Satoshi and 田湯, 智 and UENO, Shuichi and 上野, 修一},
 issue = {12},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, The harmonious coloring of an undirected simple graph is a vertex coloring such that adjacent vertices are assigned different colors and each pair of colors appears together on at most one edge. The harmonious chromatic number of a graph is the least number of colors used in such a coloring. The harmonious chromatic number of a path is known, whereas the problem to find the harmonious chromatic number is NP-hard even for trees with pathwidth at most 2. Hence, we consider the harmonious coloring of trees with pathwidth 1, which are also known as caterpillars. This paper shows the harmonious chromatic number of a caterpillar with at most one vertex of degree more than 2. We also show the upper bound of the harmonious chromatic number of a 3-regular caterpillar.},
 pages = {2199--2206},
 title = {A Note on Harmonious Coloring of Caterpillars},
 volume = {E98D},
 year = {2015},
 yomi = {タカオカ, アサヒ and オオクマ, シンゴ and タユ, サトシ and ウエノ, シュウイチ}
}