Edge-Face Total Chromatic Number of Halin Graphs

W. H. Chan, Peter C. B. Lam, W. C. Shiu

Research output: Contribution to journalJournal articlepeer-review

6 Citations (Scopus)
24 Downloads (Pure)


We show that the edge-face total chromatic number of Halin graphs with maximum vertex degree Δ not less than 4 is equal to max{5, Δ}. For the cases of Δ = 4 and 5, we provide a proper 5-edge-face total coloring algorithm.

Original languageEnglish
Pages (from-to)1646-1654
Number of pages9
JournalSIAM Journal on Discrete Mathematics
Issue number3
Publication statusPublished - 11 Nov 2009

Scopus Subject Areas

  • Mathematics(all)

User-Defined Keywords

  • Edge-face total chromatic number
  • Halin graphs


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

Cite this