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

Wai Hong CHAN, Che Bor Peter LAM, Wai Chee SHIU

Research output: Contribution to journalArticles

Abstract

The edge-face total chromatic number of 3-regular Halin graphs was shown to be 4 or 5 in [5]. In this paper, we shall provide a necessary and sufficient condition to characterize 3-regular Halin graphs with edge-face total chromatic number equal to four. Copyright © 2014 The Charles Babbage Research Centre.
Original languageEnglish
Pages (from-to)257-262
JournalArs Combinatoria
Volume113
Publication statusPublished - Jan 2014

Citation

Chan, W. H., Lam, P. C. B., & Shiu, W. C. (2014). Characterization of 3-regular halin graphs with edge-face total chromatic number equal to four. Ars Combinatoria, 113, 257-262.

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.