Edge-Face Total Chromatic Number of Halin Graphs

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

doi:10.1137/070687988

Edge-Face Total Chromatic Number of Halin Graphs

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

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

6 Citations (Scopus)

50 Downloads (Pure)

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.

Original language	English
Pages (from-to)	1646-1654
Number of pages	9
Journal	SIAM Journal on Discrete Mathematics
Volume	23
Issue number	3
DOIs	https://doi.org/10.1137/070687988
Publication status	Published - 11 Nov 2009

User-Defined Keywords

Edge-face total chromatic number
Halin graphs

Access to Document

10.1137/070687988

Full TextFinal published version, 523 KB

Cite this

@article{a849f4e8fbc542f0987dc0b7dd444a7c,

title = "Edge-Face Total Chromatic Number of Halin Graphs",

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.",

keywords = "Edge-face total chromatic number, Halin graphs",

author = "Chan, \{W. H.\} and Lam, \{Peter C. B.\} and Shiu, \{W. C.\}",

note = "Funding information: This work was partially supported by Faculty Research Grant (FRG/07-08/II-30), Hong Kong Baptist University, and CERG (HKBU210207), Research Grant Council, Hong Kong. Publisher copyright: Copyright {\textcopyright} 2009 Society for Industrial and Applied Mathematics",

year = "2009",

month = nov,

day = "11",

doi = "10.1137/070687988",

language = "English",

volume = "23",

pages = "1646--1654",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "3",

}

TY - JOUR

T1 - Edge-Face Total Chromatic Number of Halin Graphs

AU - Chan, W. H.

AU - Lam, Peter C. B.

AU - Shiu, W. C.

N1 - Funding information: This work was partially supported by Faculty Research Grant (FRG/07-08/II-30), Hong Kong Baptist University, and CERG (HKBU210207), Research Grant Council, Hong Kong. Publisher copyright: Copyright © 2009 Society for Industrial and Applied Mathematics

PY - 2009/11/11

Y1 - 2009/11/11

N2 - 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.

AB - 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.

KW - Edge-face total chromatic number

KW - Halin graphs

UR - https://www.scopus.com/pages/publications/73249121594

U2 - 10.1137/070687988

DO - 10.1137/070687988

M3 - Journal article

AN - SCOPUS:73249121594

SN - 0895-4801

VL - 23

SP - 1646

EP - 1654

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -

Edge-Face Total Chromatic Number of Halin Graphs

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this