Edge-face total chromatic number of halin graphs

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

Research output: Contribution to journal › Articles › peer-review

3 Citations (Scopus)

Abstract

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. Copyright © 2009 Society for Industrial and Applied Mathematics.

Original languageEnglish
Pages (from-to)1646-1654
JournalSIAM Journal on Discrete Mathematics
Volume23
Issue number3
DOIs
Publication statusPublished - 2009

Citation

Chan, W. H., Lam, P. C. B., & Shiu, W. C. (2009). Edge-face total chromatic number of halin graphs. SIAM Journal on Discrete Mathematics, 23(3), 1646-1654. doi: 10.1137/070687988

Keywords

  • Edge-face total chromatic number
  • Halin graphs

Access to Document

Fingerprint Dive into the research topics of 'Edge-face total chromatic number of halin graphs'. Together they form a unique fingerprint.