Title of article :
4-edge-coloring graphs of maximum degree 3 in linear time
Author/Authors :
San Skulrattanakulchai، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
5
From page :
191
To page :
195
Keywords :
Edge-coloring , Cubic graphs , NP-completeness , Algorithms
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129462
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129462
بازگشت