Let q = 2 be, for some ∈ N, and let n = q 2 +q +1. By exhibiting a complete coloring of the edges of K n , we show that the pseudoachromatic number (G n ) of the complete line graph G n = L(K n )-or the pseudoachromatic index of K n , if you will-is at least q 3 +q. This bound improves the implicit bound of Jamison [Discrete Math 74 (1989), 99-115] which is given in terms of the achromatic number:We also calculate, precisely, the pseudoachromatic number when q +1
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.