| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651540 | Electronic Notes in Discrete Mathematics | 2016 | 8 Pages |
Abstract
A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of Behzad and Vizing conjecture on total coloring for Compound graph of G and H, where G and H are any graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S. Mohan, J. Geetha, K. Somasundaram,