Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles

Authors

Peter Johnson, Auburn University Main CampusFollow
Claire Zhang, Auburn UniversityFollow

Publication Date

2017

Abstract

For positive integers m, n, the greatest number of colors that can appear in an edge coloring of K(m,n) which avoids rainbow cycles is m + n - 1. Here these colorings are constructively characterized. It turns out that these colorings can be encoded by certain vertex labelings of full binary trees with m + n leafs.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Johnson, Peter and Zhang, Claire (2017) "Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles," Theory and Applications of Graphs: Vol. 4: Iss. 1, Article 1.
DOI: 10.20429/tag.2017.040101
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol4/iss1/1