Determining the total colouring number is np-hard. - Abdón Sánchez-Arroyo (Discret. Math., 1989)

An upper bound for total colouring of graphs. - Colin J. H. McDiarmid; Abdón Sánchez-Arroyo (Discret. Math., 1993)

Total colouring regular bipartite graphs is NP-hard. - Colin J. H. McDiarmid; Abdón Sánchez-Arroyo (Discret. Math., 1994)

A new upper bound for total colourings of graphs. - Abdón Sánchez-Arroyo (Discret. Math., 1995)

Adding evidence to the Erdos-Faber-Lovasz conjecture. - David Romero; Abdón Sánchez-Arroyo (Ars Comb., 2007)

The Erdos-Faber-Lovász conjecture for dense hypergraphs. - Abdón Sánchez-Arroyo (Discret. Math., 2008)