Tight Bounds on 1-Harmonious Coloring of Certain Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Symmetry"
DOI: 10.3390/sym11070917
Abstract: Graph coloring is one of the most studied problems in graph theory due to its important applications in task scheduling and pattern recognition. The main aim of the problem is to assign colors to the… read more here.
Keywords: coloring certain; tight bounds; bounds harmonious; graph ... See more keywords