A study of the total chromatic number of equibipartite graphs

Citations of this article
Mendeley users who have this article in their library.


The total chromatic number χ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 equibipartite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture. © 1998 Published by Elsevier Science B.V. All rights reserved.




Chen, B. L., Cheng, C. K., Fu, H. L., & Huang, K. C. (1998). A study of the total chromatic number of equibipartite graphs. Discrete Mathematics, 184(1–3), 49–60. https://doi.org/10.1016/S0012-365X(97)00160-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free