Ibrahim Khan, Mohammad
(Department of Computer Science and Engineering, BUET, 2002-10)
This thesis presents an efficient algorithm for finding an optimal I-vertex-coloring of a
partial k-tree. An I-vertex-coloring of a graph G is defined as follows: for a positive
integer I and a graph G with non-negative ...