@article{Huang2023, 
author = {Ningge Huang and Lily Chen},
title = {AVD edge-colorings of cubic Halin graphs},
year = {2023},
journal = {AIMS Mathematics},
volume = {8},
number = {11},
pages = {27820-27839},
keywords = {AVD edge-coloring, adjacent vertex-distinguishing chromatic index, Halin graphs, cubic graphs},
url = {https://www.sciopen.com/article/10.3934/math.20231423},
doi = {10.3934/math.20231423},
abstract = {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.}
}