UNIVERSITY of GLASGOW

Computing at Glasgow University
 
Paper ID: 5888

NP-completeness of a family of graph colouring problems
Irving,R.W.

Publication Type: Journal
Appeared in: Discrete Applied Mathematics Volume No. 5
Page Numbers : 111-117
Publisher: Elsevier Science
Year: 1983
ISBN/ISSN:
Abstract:

No abstract available.


Bibtex entry Endnote XML