Table of Contents
International Journal of Combinatorics
Volume 2015, Article ID 201427, 7 pages
http://dx.doi.org/10.1155/2015/201427
Research Article

On Evenly-Equitable, Balanced Edge-Colorings and Related Notions

Department of Mathematics and Statistics, Auburn University, 221 Parker Hall, Auburn, Al 36849-5310, USA

Received 23 September 2014; Accepted 16 February 2015

Academic Editor: Toufik Mansour

Copyright © 2015 Aras Erzurumluoğlu and C. A. Rodger. 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. D. de Werra, “Balanced schedules,” INFOR—Canadian Journal of Operational Research and Information Processing, vol. 9, pp. 230–237, 1971. View at Google Scholar
  2. D. de Werra, “Equitable colorations of graphs,” Revue française d'Informatique et de Recherche Operationelle, vol. R-3, pp. 3–8, 1971. View at Google Scholar
  3. D. de Werra, “A few remarks on chromatic scheduling, combinatorial programming: methods and applications (Proceedings of the NATO advanced study institute, Versailles, France, 1974),” in Nato Science Series C: Mathematical and Physical Sciences, vol. 19, pp. 337–342, Reidel, Dordrecht, The Netherlands, 1975. View at Google Scholar
  4. D. de Werra, “On a particular conference scheduling problem,” INFOR, Canadian Journal of Operations Research and Information Processing, vol. 13, no. 3, pp. 308–315, 1975. View at Google Scholar · View at MathSciNet
  5. A. J. Hilton, “Canonical edge-colourings of locally finite graphs,” Combinatorica, vol. 2, no. 1, pp. 37–51, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. G. Hoffman and C. A. Rodger, “Class one graphs,” Journal of Combinatorial Theory: Series B, vol. 44, no. 3, pp. 372–376, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  7. D. G. Hoffman and C. A. Rodger, “The chromatic index of complete multipartite graphs,” Journal of Graph Theory, vol. 16, no. 2, pp. 159–163, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  8. A. J. Hilton and D. de Werra, “A sufficient condition for equitable edge-colourings of simple graphs,” Discrete Mathematics, vol. 128, no. 1–3, pp. 179–201, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. X. Zhang and G. Liu, “Equitable edge-colorings of simple graphs,” Journal of Graph Theory, vol. 66, no. 3, pp. 175–197, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. A. J. W. Hilton, “(r, r + 1)-factorizations of (d, d + 1)-graphs,” Discrete Mathematics, vol. 308, no. 5-6, pp. 645–669, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. C. D. Leach and C. A. Rodger, “Fair Hamilton decompositions of complete multipartite graphs,” Journal of Combinatorial Theory. Series B, vol. 85, no. 2, pp. 290–296, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. A. Erzurumluoglu and C. A. Rodger, “Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs,” Submitted.
  13. M. A. Bahmanian and C. A. Rodger, “Multiply balanced edge colorings of multigraphs,” Journal of Graph Theory, vol. 70, no. 3, pp. 297–317, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North Holland, Amsterdam, The Netherlands, 1976.