The NP-completeness of (1,r)-subcolorability of cubic...

Information Processing Letters 2002 Vol. 81; Iss. 3

The NP-completeness of (1,r)-subcolorability of cubic graphs

Hoàng-Oanh Le, Van Bang Le
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
81
Year:
2002
Language:
english
Pages:
6
DOI:
10.1016/s0020-0190(01)00205-8
File:
PDF, 90 KB
english, 2002
Conversion to is in progress
Conversion to is failed