Title of article :
The NP-completeness of (1,r)-subcolorability of cubic graphs
Author/Authors :
Hoàng-Oanh Le، نويسنده , , Van Bang Le، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
6
From page :
157
To page :
162
Keywords :
Combinatorial problem , Cubic graph , Planar graph , Subcoloring , computational complexity
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129457
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129457
بازگشت