Edge-face total chromatic number of 3-regular halin graphs

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

Research output: Contribution to journal › Article

Abstract

A Halin graph is a plane graph H = T U 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 ≤ Xef(G) ≤ 5; and these bounds are sharp. Copyright © 2000 Utilitas Mathematica Pub. Inc.
Original languageEnglish
Pages (from-to)161-165
JournalCongressus Numerantium
Volume145
Publication statusPublished - 2000

Citation

Lam, P. C. B., Shiu, W. C., & Chan, W. H. (2000). Edge-face total chromatic number of 3-regular halin graphs. Congressus Numerantium, 145, 161-165.

Keywords

  • Edge-face total chromatic number
  • Halin graph

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