#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1989

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Abdón Sánchez-Arroyo
- Discrete Mathematics
- 1989

The total chromatic number X,(G) of a graph G is the minimum number of colours required to colour the edges and vertices of G in such a way that no two adjacent or incident elements of G have the same colour. Clearly &(G) 2 d(G) + 1, where d(G) is the maximum degree of G. It is a long standing conjecture that XT(G) d d(G) + 2. For example it is easily seen… (More)

- Colin McDiarmid, Abdón Sánchez-Arroyo
- Discrete Mathematics
- 1994

The total chromatic number of an arbitrary graph is the smallest number of colours needed to colour the edges and vertices of the graph so that no two adjacent or incident elements of the graph receive the same colour. In this paper we prove that the problem of determining the total chromatic number of a k-regular bipartite graph is NP-hard, for each fixed… (More)

- Colin McDiarmid, Abdón Sánchez-Arroyo
- Discrete Mathematics
- 1993

- Juan Manuel Fernández-Vázquez, U Ayala-Gamboa, Javier Camacho-Galindo, Abdón Sánchez-Arroyo
- Acta ortopedica mexicana
- 2011

Enchondroma is the most frequent benign tumor in hand bones. It occasionally occurs in the distal phalanx of the fingers; it is usually an asymptomatic lesion, but pain may occur when it is associated with a fracture. The most recommended treatment is lesion curettage and application of a bone graft, besides fixation as needed. Five cases with location in… (More)

- Abdón Sánchez-Arroyo
- Discrete Mathematics
- 2008

- David Romero, Abdón Sánchez-Arroyo
- Ars Comb.
- 2007

- Abdón Sánchez-Arroyo
- Discrete Mathematics
- 1995

- ‹
- 1
- ›