On the harmonious chromatic number of graphs

arXiv2206.04822MaRDI QIDQ6401634FDOQ6401634

Authors: G. Araujo-Pardo, Juan José Montellano-Ballesteros, M. Olsen, Christian Rubio-Montiel 

Publication date: 9 June 2022

Abstract: The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. In this paper, we give various results on harmonious chromatic numbers related to homomorphisms, the incidence graph of finite linear systems, and the known circulant graphs.

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On the harmonious chromatic number of graphs

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