[r,s,t] COLOURING DARI K (1,2,3)
| Main Authors: | Manopo, Jimi, Baki, Swita, Mudin, Simanihuruk |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2012
|
| Subjects: | |
| Online Access: |
http://repository.unib.ac.id/4372/1/JIMI%20MANOPO.pdf http://repository.unib.ac.id/4372/ |
Daftar Isi:
- 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.