On the pseudoachromatic index of the complete graph III
Combinatorics
2018-10-01 v1
Abstract
Let be the projective plane of order , let the pseudoachromatic number of the complete line graph of order , let and . In this paper, we improve the upper bound of given by Araujo-Pardo et al. [J Graph Theory 66 (2011), 89--97] and Jamison [Discrete Math. 74 (1989), 99--115] in the following values: if is an integer and then . On the other hand, if is even and there exists we give a complete edge-colouring of with colours. Moreover, using this colouring we extend the previous results for given by Araujo-Pardo et al. in [J Graph Theory 66 (2011), 89--97] and [Bol. Soc. Mat. Mex. (2014) 20:17--28] proving that for .
Keywords
Cite
@article{arxiv.1507.08338,
title = {On the pseudoachromatic index of the complete graph III},
author = {G. Araujo-Pardo and J. J. Montellano-Ballesteros and C. Rubio-Montiel and R. Strausz},
journal= {arXiv preprint arXiv:1507.08338},
year = {2018}
}
Comments
10 pages, 2 figures