مرکز منطقه ای اطلاع رساني علوم و فناوري - Acyclic coloring of graphs of maximum degree five: Nine colors are enough

Title of article :

Acyclic coloring of graphs of maximum degree five: Nine colors are enough

Author/Authors :

Guillaume Fertin، نويسنده , , André Raspaud، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2007

Pages :

From page :

To page :

Keywords :

Acyclic chromatic number , Acyclic coloring algorithm , Maximum degree 5 , graph algorithms

Journal title :

Information Processing Letters

Serial Year :

2007

Journal title :

Information Processing Letters

Record number :

130533

Link To Document :