Abstract.
Given a graph G and a positive integer r, let f r (G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f r (K n,n ) exactly and f r (K n ) within 1. In doing so, we disprove a conjecture by Manoussakis, Spyratos, Tuza and Voigt in [4].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: May 17, 1999 Final version received: January 12, 2000
Rights and permissions
About this article
Cite this article
Jiang, T. Edge-Colorings with No Large Polychromatic Stars. Graphs Comb 18, 303–308 (2002). https://doi.org/10.1007/s003730200022
Issue Date:
DOI: https://doi.org/10.1007/s003730200022