Title of article :
Exact complexity of Exact-Four-Colorability
Author/Authors :
J?rg Rothe، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Keywords :
computational complexity , Graph colorability , Completeness , Boolean hierarchy
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters