Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
It is well known that if the edges of a finite simple connected graph on <em>n</em> vertices are colored so that no cycle is rainbow, then no more than <em>n-1</em> colors can appear on the edges. In previous work it has been shown that the essentially different rainbow-cycle...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2017-11-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol4/iss2/2 |