✦ LIBER ✦

The harmonious chromatic number of a complete binary and trinary tree

✍ Scribed by Zhikang Lu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 548 KB
Volume: 118
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90059-3

No coin nor oath required. For personal study only.

✦ Synopsis

Lu, Z., The harmonious chromatic number of a complete binary and trinary tree, Discrete Mathematics 118 (1993) 1655172.

📜 SIMILAR VOLUMES

The exact value of the harmonious chroma

The exact value of the harmonious chromatic number of a complete binary tree

✍ Zhikang Lu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors needed to color the vertices of G in such a way that adjacent vertices are colored by different colors and any two distinct edges receive different color pairs. D. Johnson has shown that the problem of deter

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

The growth rate of the harmonious chroma

The growth rate of the harmonious chromatic number

✍ Donald G. Beane; Norman L. Biggs; Brian J. Wilson 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB

A new upper bound for the harmonious chr

A new upper bound for the harmonious chromatic number

✍ Edwards, Keith 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o