Title of article
On Tucker vertices of graphs Original Research Article
Author/Authors
Sylvain Gravier and Julien Moncel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
11
From page
121
To page
131
Abstract
We give a sequential algorithm to color a new class of perfect graphs. Our algorithm is based on a 3-chromatic exchange using Tuckerʹs algorithm for 3-coloring the perfect graphs that do not contain a clique of size four.
Keywords
Perfect graphs , Chromatic number , Tucker algorithm
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950855
Link To Document