𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the harmonious coloring of collections of graphs

✍ Scribed by John P. Georges

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
741 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The hermonious coloring number of the graph G, HC(G), is the smallest number of colors needed to label the vertices of G such that adjacent vertices received different colors and no two edges are incident with the same color pair. In this paper, we investigate the HC‐number of collections of disjoint paths, cycles, complete graphs, and complete bipartite graphs. We determine exact expressions for the HC‐number of collections of paths and 4__m__‐cycles. Β© 1995, John Wiley & Sons, Inc.

πŸ“œ SIMILAR VOLUMES

On equitable coloring of bipartite graph
On equitable coloring of bipartite graphs
✍ Ko-Wei Lih; Pou-Lin Wu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 285 KB

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~I-IV~[I ~< 1 for all i#j, then G is said to be equitably colored with k colors. The smallest integer n for which G can be equitably colored with n colors is called the equitab

Harmonious labelings of windmill graphs
Harmonious labelings of windmill graphs and related graphs
✍ D. Frank Hsu πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ β‰₯ 1, __K__^(__t__^)~__n__~ is strongly

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

Star coloring of graphs
Star coloring of graphs
✍ Guillaume Fertin; AndrΓ© Raspaud; Bruce Reed πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

## Abstract A __star coloring__ of an undirected graph __G__ is a proper vertex coloring of __G__ (i.e., no two neighbors are assigned the same color) such that any path of length 3 in __G__ is not bicolored. The __star chromatic number__ of an undirected graph __G__, denoted by Ο‡~s~(__G__), is the