Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2011, Article ID 279246, 5 pages
http://dx.doi.org/10.1155/2011/279246
Research Article

Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths

1Department of Mathematics, University College of Engineering Nagercoil, Anna University of Technology Tirunelveli (Nagercoil Campus), Nagercoil 629 004, Tamil Nadu, India
2Department of Mathematics, R.V.S College of Engineering and Technology, Coimbatore 641 402, Tamil Nadu, India
3Department of Mathematics, Sri Shakthi Institute of Engineering and Technology, Coimbatore 641 062, Tamil Nadu, India

Received 2 December 2010; Accepted 9 February 2011

Academic Editor: Marco Squassina

Copyright © 2011 J. Vernold Vivin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. M. M. Akbar, K. Kaliraj, and J. Vernold Vivin, β€œOn equitable coloring of central graphs and total graphs,” in International Conference on Graph Theory and Its Applications, vol. 33 of Electronic Notes in Discrete Mathematics, pp. 1–6, Elsevier Science, Amsterdam, The Netherlands, 2009. View at Google Scholar
  2. J. Vernold Vivin, Harmonious coloring of total graphs, n-leaf, central graphs and circumdetic graphs, Ph.D. thesis, Bharathiar University, Coimbatore, India, 2007.
  3. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, MacMillan, London, UK, 1976.
  4. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, USA, 1969.
  5. B.-L. Chen and K.-W. Lih, β€œEquitable coloring of trees,” Journal of Combinatorial Theory. Series B, vol. 61, no. 1, pp. 83–87, 1994. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  6. H. Furmaczyk and M. Kubale, β€œThe complexity of equitable Vertex coloring of graphs,” Journal of Applied Computer Science, vol. 13, no. 2, pp. 95–107, 2005. View at Google Scholar
  7. H. L. Bodlaender and F. V. Fomin, β€œEquitable colorings of bounded treewidth graphs,” Theoretical Computer Science, vol. 349, no. 1, pp. 22–30, 2005. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  8. K.-W. Lih and P.-L. Wu, β€œOn equitable coloring of bipartite graphs,” Discrete Mathematics, vol. 151, no. 1–3, pp. 155–160, 1996. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  9. M. Kubale, Graph Colorings, vol. 352 of Contemporary Mathematics, American Mathematical Society, Providence, RI, USA, 2004.
  10. W. Meyer, β€œEquitable coloring,” The American Mathematical Monthly, vol. 80, pp. 920–922, 1973. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH