Heuristic method to determine lucky k-polynomials for k-colorable graphs

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

[2] F. Harary, Graph Theory, Addison-Wesley, Reading MA, (1969). ⇒20610.21236/AD0705364Search in Google Scholar

[3] E. G. Mphako-Banda, J. Kok, Chromatic completion number, arXiv: 1809.01136v2. ⇒206, 207, 210Search in Google Scholar

[4] E. G. Mphako-Banda, J. Kok, Stability in respect of chromatic completion of graphs, arXiv:1810.13328v1. ⇒207Search in Google Scholar

[5] E. G. Mphako-Banda, An introduction to the k-defect polynomials, Quaestiones Mathematicae, 42, 2 (2019) 1–10. ⇒20710.2989/16073606.2018.1443168Search in Google Scholar

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