Total colouring regular bipartite graphs is NP-hard

  • Authors:
  • Colin J. H. McDiarmid;Abdón Sánchez-Arroyo

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the first Malta conference on Graphs and combinatorics
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract