### Coloring sums of extensions of certain graphs

#### Abstract

#### Full Text:

PDF#### References

A. Banerjee, S. Bej, On extension of regular graphs, arXiv:1509.05476v1 [math.CO].

J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, 2008.

S. Cabello, M. Jacovac, On the b–chromatic number of regular graphs, Discrete Appl. Math. 159 (2011) 1303–1310.

G. Chartrand, L. Lesniak, Graphs and Digraphs, CRC Press, 2000.

J. T. Gross, J. Yellen, Graph Theory and Its Applications, CRC Press, 2006.

J. E. Hopcroft, R. M. Karp, An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2(4) (1973) 225–231.

J. Kok, N. K. Sudev, K. P. Chithra, Generalised colouring sums of graphs, Cogent Math. 3(1) (2016) 1–11.

M. Kouider, A. El Sahili, About b–coloring of regular graphs, Rapport de Recherche, No. 1432, CNRS–Universite Paris Sud–LRI.

E. Kubicka, A. J. Schwenk, An introduction to chromatic sums, Proc. ACM Computer Sci. Conf. (Louisville) (1989) 39–45.

P. C. Lisna, M. S. Sunitha, b–chromatic sum of a graph, Discrete Math. Algorithm. Appl. 7(4) (2015) 1–15.

N. K. Sudev, K. P. Chithra, J. Kok, Certain chromatic sums of some cycle-related graph classes, Discrete Math. Algorithm. Appl. 8(3) (2016) 1–25.

### Refbacks

- There are currently no refbacks.

ISSN: 2148-838X