Harmonious Coloring of Graph, M.Sc. Thesis Sharif University of Technology ; Jafari, Amir (Supervisor)
Abstract
Let G be a simple graph. A harmonious coloring of 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. In this project, first we discuss about complexity of harmonious coloring. Then we find some bounds for harmonious chromatic number
Cataloging briefHarmonious Coloring of Graph, M.Sc. Thesis Sharif University of Technology ; Jafari, Amir (Supervisor)
Abstract
Let G be a simple graph. A harmonious coloring of 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. In this project, first we discuss about complexity of harmonious coloring. Then we find some bounds for harmonious chromatic number
Find in contentBookmark |
|