• A DISCUSSION ON BOUNDS FOR 1-QUASI TOTAL COLOURINGS

Abstract

This manuscript commences with new perception of 1-quasi total colouring and diverse bounds of the 1-quasi total colourings. The upper bound for 1-quasi total chromatic number is observed as 2+ using list edge chromatics numbers. Also it has been identified that at most +8log8 colours are required to properly coloured 1-quasi total graphs and to provide a polynomial time algorithm. Also it has been widened the Colin J.H, Mc.Diarmid and Abdon sanchez upper bound to1-quasi total graphs as .