Title of article :
Between 2- and 3-colorability
Author/Authors :
Vadim V. Lozin، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2005
Keywords :
3-colorability , Polynomial-time algorithm , computational complexity , Hereditary class of graphs
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters