TY  - JOUR
AU  - Huang, Ningge
AU  - Chen, Lily
PY  - 2023
TI  - AVD edge-colorings of cubic Halin graphs
JO  - AIMS Mathematics
SP  - 27820
EP  - 27839
VL  - 8
IS  - 11
AB  - 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.
UR  - https://doi.org/10.3934/math.20231423
DO  - 10.3934/math.20231423