Degree tolerant coloring of graph

[1] M. Aouchiche, P. Hansen, A survey of Nordhaus-Gaddum type relations, Discrete Applied Mathematics, 161 (2013) 466–546. ⇒229Search in Google Scholar

[2] J. A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London, (1976). ⇒21710.1007/978-1-349-03521-2Search in Google Scholar

[3] L. Cowen, R. Cowen, D. Woodall, Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valence, Journal of Graph Theory, 10 (1986) 187–195. ⇒21710.1002/jgt.3190100207Search in Google Scholar

[4] L. Cowen, W. Goddard, C. Jesurum, Coloring with defect, Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 548–557. ⇒217Search in Google Scholar

[5] F. Harary, Graph Theory, Addison-Wesley, Reading MA, 1969. ⇒21710.21236/AD0705364Search in Google Scholar

[6] F. Harary, K. Jones, Conditional colorability II: Bipartite variations, Congressus Numer., 50 (1985) 205–218. ⇒217Search in Google Scholar

[7] N. K. Sudev, On certain J -colouring parameters of graphs, Nat. Acad. Sci. Lett., 43 (2020) 53–57. ⇒219Search in Google Scholar

[8] B. West, Introduction to Graph Theory, Prentice-Hall, Upper Saddle River, (1996). ⇒217Search in Google Scholar