✦ LIBER ✦

Upper bounds for harmonious colorings

✍ Scribed by Colin McDiarmid; Luo Xinhua

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 301 KB
Volume: 15
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190150606

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A harmonious coloring of a simple graph G is a coloring of the vertices such that adjacent vertices receive distinct colors and 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 improve an upper bound on h(G) due to Lee and Mitchem, and give upper bounds for related quantities.

📜 SIMILAR VOLUMES

New upper bounds on harmonious colorings

✍ Keith Edwards; Colin McDiarmid 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB

## Abstract We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider „fragmentable”︁ classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded‐sized components by removing

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

On an upper bound for the harmonious chr

On an upper bound for the harmonious chromatic number of a graph

✍ Zhikang Lu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.

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

New upper bounds for the greatest number

New upper bounds for the greatest number of proper colorings of a (V,E)-graph

✍ Felix Lazebnik 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Let 𝒻 denote the family of simple undirected graphs on __v__ vertices having __e__ edges ((__v__, __e__)‐graphs) and __P__(__G__; λ) be the chromatic polynomial of a graph __G.__ For the given integers __v__, __e__, and λ, let __f__(__v__, __e__, λ) denote the greatest number of proper