A study of the total chromatic number of equibipartite graphs

被引：1
|
作者：
Chen, BL
Cheng, CK
Fu, HL
Huang, KC
机构：
[1] Tunghai Univ, Dept Math, Taichung 40704, Taiwan
[2] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan
[3] Providence Univ, Dept Math Appl, Taichung, Taiwan
来源：
DISCRETE MATHEMATICS | 1998年 / 184卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(97)00160-X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The total chromatic number chi(t)(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibiparrite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
引用
收藏
页码：49 / 60
页数：12
相关论文
共 50 条
12345