AVD edge-colorings of cubic Halin graphs
| Autor: | Ningge Huang, Lily Chen |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | AIMS Mathematics, Vol 8, Iss 11, Pp 27820-27839 (2023) |
| Druh dokumentu: | article |
| ISSN: | 20231423 2473-6988 |
| DOI: | 10.3934/math.20231423?viewType=HTML |
| Popis: | The adjacent vertex-distinguishing edge-coloring of a graph $ G $ is a proper edge-coloring of $ G $ such that each pair of adjacent vetices receives a distinct set of colors. The minimum number of colors required in an adjacent vertex-distinguishing edge-coloring of $ G $ is called the adjacent vertex-distinguishing chromatic index. In this paper, we determine the adjacent vertex distinguishing chromatic indices of cubic Halin graphs whose characteristic trees are caterpillars. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|