AVDTC of generalized 3-Halin graphs


In this paper, we prove that the adjacent vertex distinguishing total chromatic number of a generalized Halin graph with maximum degree 3 is 5. This result answers an open question of Chen and Zhang [11].

DOI: 10.1109/IISA.2016.7785421

8 Figures and Tables

Cite this paper

@article{Bekos2016AVDTCOG, title={AVDTC of generalized 3-Halin graphs}, author={Michael A. Bekos and Michael Kaufmann and Chrysanthi N. Raftopoulou}, journal={2016 7th International Conference on Information, Intelligence, Systems & Applications (IISA)}, year={2016}, pages={1-6} }