Title of article
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
Author/Authors
André Gro?e، نويسنده , , J?rg Rothe، نويسنده , , Gerd Wechsung، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2006
Pages
7
From page
215
To page
221
Keywords
computational complexity , Self-reducibility , Graph colorability
Journal title
Information Processing Letters
Serial Year
2006
Journal title
Information Processing Letters
Record number
130299
Link To Document