Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Shingo Okuma"'
Publikováno v:
IEICE Transactions on Information and Systems. :2199-2206
SUMMARY The harmonious coloring of an undirected simple graph is a vertex coloring such that adjacent vertices are assigned different colors and each pair of colors appears together on at most one edge. The harmonious chromatic number of a graph is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b35b82e1a9576709cc809001fe524a57
https://doi.org/10.1587/transinf.2015edp7113
https://doi.org/10.1587/transinf.2015edp7113
