A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs
β Scribed by Claudio Arbib
- Book ID
- 108498080
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 85 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider colorings of the directed and undirected edges of a mixed multigraph G by an ordered set of colors. We color each undirected edge in one color and each directed edge in two colors, such that the color of the first half of a directed edge is smaller than the color of the second half. The
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
## 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.