Characterization of 3-regular Halin graphs with edge-face total chromatic number equal to four

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

Research output: Contribution to journalJournal articlepeer-review

Abstract

The edge-face total chromatic number of 3-regular Halingraphs was shown to be 4 or 5 in [P. C. B. Lam, W. C. Shiu and W. H. Chan, Edge-face total chromatic number of 3-regular Halin graphs, Congressus Numerantium, 145, 161–165 (2000)]. In this paper, we shall provide anecessary and sufficient condition to characterize 3-regular Halingraphs with edge-face total chromatic number equal to four.

Original languageEnglish
Pages (from-to)257-262
Number of pages6
JournalArs Combinatoria
Volume113
Publication statusPublished - Jan 2014

Scopus Subject Areas

  • Mathematics(all)

User-Defined Keywords

  • Edge-face total chromatic number
  • Halin graphs

Fingerprint

Dive into the research topics of 'Characterization of 3-regular Halin graphs with edge-face total chromatic number equal to four'. Together they form a unique fingerprint.

Cite this