<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>5888</REFNUM><AUTHORS><AUTHOR>Irving,R.W.</AUTHOR></AUTHORS><YEAR>1983</YEAR><TITLE>NP-completeness of a family of graph colouring problems</TITLE><PLACE_PUBLISHED>Discrete Applied Mathematics Volume No. 5 </PLACE_PUBLISHED><PUBLISHER>Elsevier Science</PUBLISHER><PAGES>111-117</PAGES><LABEL>Irving:1983:5888</LABEL><ABSTRACT> </ABSTRACT></RECORD></RECORDS></XML>