HIGHLIGHTS
- who: Indu-Bala product and colleagues from the Department of, Amrita School of Physical Science, Amrita Vishwa Vidyapeetham, Coimbatore, Tamil Nadu, India b School of Computer Science and Engineering, Presidency University, Bengaluru, Karnataka, India have published the research work: Total coloring conjecture on certain classes of product graphs, in the Journal: (JOURNAL) of 31/01/2019
SUMMARY
If a graph G is total colorable with ∆(G) + 1 colors then the graph is called Type - I, and if it is total colorable with ∆(G) + 2 colors but not ∆(G) + 1 colors, then it is . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.