[r,s,t] COLOURING DARI K (1,2,3)

Manopo, Jimi and Baki, Swita and Mudin, Simanihuruk (2012) [r,s,t] COLOURING DARI K (1,2,3). Undergraduated thesis, Fakultas Matematika Dan Ilmu Pengetahuan Alam UNIB.

[img] Text
JIMI MANOPO.pdf - Bibliography
Restricted to Registered users only
Available under License Creative Commons GNU GPL (Software).

Download (13MB)


Given non-negative integers and , an -colouring of a graph is a mapping from to the colour set such that for every two adjacent vertices , for every two adjacent edges and for all pairs of incident vertices and edges, respectively. The -chromatic number of is defined to be the minimum such that admits an -colouring. The purpose of this research is to find the -chromatic number of 3-partite graph for some value of and subject to . The method which is used in this research is direct proof and contradiction.

Item Type: Thesis (Undergraduated)
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Math & Natural Science > Department of Math Science
Depositing User: 014 Abd. Rachman Rangkuti
Date Deposited: 15 Dec 2013 11:40
Last Modified: 15 Dec 2013 11:40
URI: http://repository.unib.ac.id/id/eprint/4372

Actions (login required)

View Item View Item