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

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

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-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 language	English
Pages (from-to)	257-262
Number of pages	6
Journal	Ars Combinatoria
Volume	113
Publication status	Published - Jan 2014

User-Defined Keywords

Edge-face total chromatic number
Halin graphs

Cite this

@article{c444c45fd5f84a88a55f4a05eb82d131,

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

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

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

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

note = "Funding information: Partially supported by Faculty Research Grant (FRG/07-08/II-30), Hong Kong Baptist University; and Research Grant Council Grant (HKBU210207), Hong Kong.",

year = "2014",

month = jan,

language = "English",

volume = "113",

pages = "257--262",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

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

AU - Chan, W. H.

AU - Lam, Peter C. B.

AU - Shiu, W. C.

N1 - Funding information: Partially supported by Faculty Research Grant (FRG/07-08/II-30), Hong Kong Baptist University; and Research Grant Council Grant (HKBU210207), Hong Kong.

PY - 2014/1

Y1 - 2014/1

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

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

KW - Edge-face total chromatic number

KW - Halin graphs

UR - http://combinatoire.ca/ArsCombinatoria/Vol113.html

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

M3 - Journal article

AN - SCOPUS:84901661666

SN - 0381-7032

VL - 113

SP - 257

EP - 262

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

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

Abstract

User-Defined Keywords

Other files and links

Fingerprint

Cite this