✦ LIBER ✦

Color harmony

✍ Scribed by Kenneth E. Burchett

Book ID: 102115348
Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 54 KB
Volume: 27
Category: Article
ISSN: 0361-2317
DOI: 10.1002/col.10004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Color harmony attributes

✍ Kenneth E. Burchett 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

Minimal harmoniously colorable designs

✍ L. R. A. Casse; Christine M. O'Keefe; B. J. Wilson 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB

A graph G is minimal harmoniously colorable if it has a proper vertex coloring in which each pair of colors occurs exactly once on a n edge. In particular, if D is a 2-design we consider the graph G whose vertices are the points and blocks of D and where two vertices of G are adjacent if and only if

Color harmony: What is it?

✍ Walter C. Granville 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 570 KB

Experimental determination of the laws o

Experimental determination of the laws of color harmony. Part 4: Color preference and the color harmony content

✍ Antal Nemcsics 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 760 KB

Harmonious color model with fragrances

✍ Kumiko Miura; Miho Saito 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 948 KB

Upper bounds for harmonious colorings

✍ Colin McDiarmid; Luo Xinhua 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

## 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