A Note on Chromatic Sum
Combinatorics
2009-01-24 v2
Abstract
The chromatic sum of a graph is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present for every graph .
Keywords
Cite
@article{arxiv.0802.1936,
title = {A Note on Chromatic Sum},
author = {Meysam Alishahi and Ali Taherkhani},
journal= {arXiv preprint arXiv:0802.1936},
year = {2009}
}