A Halin graph is a plane graph H = T ∪ C, where T is a plane tree with no vertex of degree two and at least one vertex of degree three or more, and C is a cycle connecting the end vertices of T in the cyclic order determined by a plane embedment of T. In this paper, we show that if G is a 3-regular Halin graph, then 4 ≤ χef (G) ≤ 5; and these bounds are sharp.
|Number of pages||5|
|Publication status||Published - Dec 2000|
- Edge-face total chromatic number
- Halin graph