A computer-based approach in determining the chromatic number of a graph
This study presents an algorithm in determining the chromatic number of a simple, connected graph consisting of n vertices, where 1 is less than or equal to n less than or equal to 16. The algorithm is based on the concepts of maximal independent sets of a graph. The main output is a computer progra...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1991
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15953 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This study presents an algorithm in determining the chromatic number of a simple, connected graph consisting of n vertices, where 1 is less than or equal to n less than or equal to 16. The algorithm is based on the concepts of maximal independent sets of a graph. The main output is a computer program in Turbo Pascal Version 5.0 and it displays the diagram of the inputted graph with the color number assigned to each of its vertices as determined by its chromatic number. |
|---|