Abdón Sánchez-Arroyo

2008
6	EE	Abdón Sánchez-Arroyo: The Erdos-Faber-Lovász conjecture for dense hypergraphs. Discrete Mathematics 308(5-6): 991-992 (2008)
2007
5		David Romero, Abdón Sánchez-Arroyo: Adding evidence to the Erdos-Faber-Lovasz conjecture. Ars Comb. 85: (2007)
1995
4	EE	Abdón Sánchez-Arroyo: A new upper bound for total colourings of graphs. Discrete Mathematics 138(1-3): 375-377 (1995)
1994
3	EE	Colin J. H. McDiarmid, Abdón Sánchez-Arroyo: Total colouring regular bipartite graphs is NP-hard. Discrete Mathematics 124(1-3): 155-162 (1994)
1993
2	EE	Colin J. H. McDiarmid, Abdón Sánchez-Arroyo: An upper bound for total colouring of graphs. Discrete Mathematics 111(1-3): 389-392 (1993)
1989
1	EE	Abdón Sánchez-Arroyo: Determining the total colouring number is np-hard. Discrete Mathematics 78(3): 315-319 (1989)

Coauthor Index

1	Colin McDiarmid (Colin J. H. McDiarmid)	[2] [3]
2	David Romero	[5]

Colors in the list of coauthors