Please use this identifier to cite or link to this item:
|Title:||Total colorings of equibipartite graphs|
|Source:||Chen, B.-L.,Dong, L.,Liu, Q.-Z.,Huang, K.-C. (1999). Total colorings of equibipartite graphs. Discrete Mathematics 194 (1-3) : 59-65. ScholarBank@NUS Repository.|
|Abstract:||The total chromatic number χT(G) of a graph G is the least number of colors needed to color the vertices and the edges of G such that no adjacent or incident pair of elements receive the same color. A simple graph G is called type 1 if χT(G) = Δ(G) + 1, where Δ(G) is the maximum degree of G. In this paper we prove the following conjecture of Chen et al.: An (n - 2)-regular equibipartite graph Kn,n - E(J) is type 1 if and only if J contains a 4-cycle. © 1999 Elsevier Science B.V. All rights reserved.|
|Source Title:||Discrete Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.