Characterization of 3-Regular Halin Graphs with Edge-face Total Chromatic Number Equal to Four

被引：0

作者：

Chan, W. H. ^{[1
]}

Lam, Peter C. B. ^{[2
]}

Shiu, W. C. ^{[2
]}

机构：

[1] Hong Kong Inst Educ, Dept Math & Informat Technol, Hong Kong, Hong Kong, Peoples R China

[2] Hong Kong Baptist Univ, Dept Math, Hong Kong, Hong Kong, Peoples R China

来源：

ARS COMBINATORIA | 2014年 / 113卷

关键词：

Halin graphs; edge-face total chromatic number; PLANE GRAPHS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：257 / 262

页数：6

共 9 条

[1]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[2]

Borodin O.V., 1987, METODY DISKRET ANALI, V45, P21

[3]

Chang CF, 1995, LECT NOTES COMPUT SC, V959, P396, DOI 10.1007/BFb0030858

[4]

Hu G., 1992, J TSINGHUA U, V32, P18

[5]

LAM PCB, 2000, C NUMER, V145, P161

[6] A 6-COLOR THEOREM FOR THE EDGE-FACE COLORING OF PLANE GRAPHS [J].

LIN, CQ ;

HU, GZ ;

ZHANG, ZF .

DISCRETE MATHEMATICS, 1995, 141 (1-3) :291-297

[7] Edge-face chromatic number and edge chromatic number of simple plane graphs [J].

Luo, R ;

Zhang, CQ .

JOURNAL OF GRAPH THEORY, 2005, 49 (03) :234-256

[8]

MELNIKOV L. S., 1975, ACAD PRAHA, V543

[9] A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs [J].

Wang, WF ;

Lih, KW .

DISCRETE MATHEMATICS, 2002, 253 (1-3) :87-95

← 1 →