Abstract: A Halin graph H is the union of a tree T ≠ K2 with no vertex of degree two and a cycle C connecting the end-vertices of T in the cyclic order determined by a plane embedding of T. In this paper, we classify the Halin graphs depending upon whether the tree T is unicentric or bicentric and investigate the vertex coloring properties of four classes of Halin graphs.
Keywords: In-regular circular Halin graph, in-regular belted circular Halin graph, in-regular elliptical Halin graph, in-regular belted elliptical Halin graph.
Title: Chromatic Number of in-Regular Types of Halin Graphs
Author: T. Nicholas, Sanma.G.R
International Journal of Mathematics and Physical Sciences Research
ISSN 2348-5736 (Online)
Research Publish Journals
