• CHARACTERIZATIONS OF 2-QUASI TOTAL COLORING GRAPHS
Abstract
This paper commences with new discernment of 2-quasi total colouring. It establishes various results on 2-quasi total colouring. By using new proof technique of H.P. yap it has been prove that the total colouring conjecture is extended for 2- quasi total graph of any graph G of order n having maximum degree at least n-3.
Keywords
2-quasi total graphs, complete bipartite graph, matching, saturation.
Full Text:
PDF![Creative Commons License](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |