Opening book details…
Can I read On the Harmonious Chromatic Number of a Graph on EtoBox?
On the Harmonious Chromatic Number of a Graph by John Mitchem is a Computer Science article available to read on EtoBox.
What is On the Harmonious Chromatic Number of a Graph about?
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 independently by Hopcroft and Krishnamoorthy and by Frank, Harary, and Plantholt. D. Johnson has shown that determining h(G) is an NP-complete problem. In this paper we give various other theorems on harmonious chromatic number and discuss various open questions.
Who reads On the Harmonious Chromatic Number of a Graph?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- John Mitchem
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 1989
- Language
- EN
- Field
- Computer Science (Physical Sciences)