ON LOCATING CHROMATIC NUMBER OF MYCIELSKI

• Main Author: Angelia Susanti, Debbie
• Format: Final Project
• Language: Indonesia
• Subjects: Prinsip umum matematika
• Online Access: https://digilib.itb.ac.id/gdl/view/32732
• Institution: Institut Teknologi Bandung

Let G be a finite, simple and connected graph. Let c a proper coloring of G. For i = 1; 2; :::; k define the color class Ci as the set of vertices receiving color i. The color code of a vertex v in G is the ordered k-tuple c(v) = (d(v;C1); d(v;C2); :::; d(v;Ck)) where d(v;Ci) is the distance of v...