Abdón Sánchez-Arroyo

According to our database, Abdón Sánchez-Arroyo authored at least 6 papers between 1989 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

The Erdos-Faber-Lovász conjecture for dense hypergraphs.

Abdón Sánchez-Arroyo

Discret. Math., 2008

2007

Adding evidence to the Erdos-Faber-Lovasz conjecture.

David Romero, Abdón Sánchez-Arroyo

Ars Comb., 2007

1995

A new upper bound for total colourings of graphs.

Abdón Sánchez-Arroyo

Discret. Math., 1995

1994

Total colouring regular bipartite graphs is NP-hard.

Colin J. H. McDiarmid, Abdón Sánchez-Arroyo

Discret. Math., 1994

1993

An upper bound for total colouring of graphs.

Colin J. H. McDiarmid, Abdón Sánchez-Arroyo

Discret. Math., 1993

1989

Determining the total colouring number is np-hard.

Abdón Sánchez-Arroyo

Discret. Math., 1989