@techreport{TR-IC-04-13,
  number = {IC-04-13},
  author = {Caterina De Simone and
            Célia Picinin de Mello},
  title = {Edge-Colouring of Join Graphs},
  month = {December},
  year = {2004}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 10 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       We discuss the following conjecture: 
       \par
       If $G$ is a graph with $n$ vertices and maximum degree
       $\Delta > n/3$, then $G$ is 1-factorizable.
  }
}