Abdón Sánchez-Arroyo

Learn More
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)
  • 1