On the harmonious chromatic number of graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913597559406592 |
|---|---|
| author | Araujo-Pardo, Gabriela Montellano-Ballesteros, Juan José Olsen, Mika Rubio-Montiel, Christian |
| author_facet | Araujo-Pardo, Gabriela Montellano-Ballesteros, Juan José Olsen, Mika Rubio-Montiel, Christian |
| contents | 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. This paper gives various results on harmonious chromatic number related to homomorphisms, incidence graphs of finite linear systems, and some circulant graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_04822 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | On the harmonious chromatic number of graphs Araujo-Pardo, Gabriela Montellano-Ballesteros, Juan José Olsen, Mika Rubio-Montiel, Christian Combinatorics 05C15, 05B25, 05C60 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. This paper gives various results on harmonious chromatic number related to homomorphisms, incidence graphs of finite linear systems, and some circulant graphs. |
| title | On the harmonious chromatic number of graphs |
| topic | Combinatorics 05C15, 05B25, 05C60 |
| url | https://arxiv.org/abs/2206.04822 |