A note on chromatic sum.

MaRDI QIDQ3447587zbMATH OpenFDO

Authors Meysam Alishahi, Ali Taherkhani

Publication date 27 October 2015

Full work available at URL https://arxiv.org/abs/0802.1936

zbMATH Keywords

chromatic sumfractional chromatic numbergraph homomorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: The chromatic sum $Sigma(G)$ of a graph $G$ 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 $Sigma(G)<ch{i}_f(G)|G|$ for every graph $G$.

Recommendations

• On the edge-difference and edge-sum chromatic sum of the simple graphs
• scientific article; zbMATH DE number 4154469
• Total colorings of graphs with minimum sum of colors
• Comparison of sum choice number with chromatic sum
• Tabular graphs and chromatic sum

Cited in

(2)

• Colored graph homomorphisms
• On the edge-difference and edge-sum chromatic sum of the simple graphs

This page was built for publication: A note on chromatic sum.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447587)