2-subcoloring is NP-complete for planar comparability...

Information Processing Letters 2017 / 12 Vol. 128

2-subcoloring is NP-complete for planar comparability graphs

Ochem, Pascal
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:
128
Language:
english
Journal:
Information Processing Letters
DOI:
10.1016/j.ipl.2017.08.004
Date:
December, 2017
File:
PDF, 185 KB
english, 2017
Conversion to is in progress
Conversion to is failed