Edge-face Total Chromatic Number of 3-Regular Halin Graphs

Peter Che Bor Lam, Wai Chee Shiu, Wai Hong Chan

Research output: Contribution to journalJournal articlepeer-review


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.
Original languageEnglish
Pages (from-to)161-165
Number of pages5
JournalCongressus Numerantium
Publication statusPublished - Dec 2000

User-Defined Keywords

  • Edge-face total chromatic number
  • Halin graph


Dive into the research topics of 'Edge-face Total Chromatic Number of 3-Regular Halin Graphs'. Together they form a unique fingerprint.

Cite this