A computer-based approach in determining the chromatic number of a graph
Date of Publication
1991
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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.
Abstract Format
html
Language
English
Format
Accession Number
TU05701
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
75 leaves
Keywords
Computer programs; Programming (Mathematics); Algorithms; Graphic methods; Graphs
Recommended Citation
De la Rosa, M. L., & Gonzales, E. P. (1991). A computer-based approach in determining the chromatic number of a graph. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15953
