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...

Full description

Saved in:
Bibliographic Details
Main Authors: De la Rosa, Martin L., Gonzales, Eric P.
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
id oai:animorepository.dlsu.edu.ph:etd_bachelors-16466
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-164662022-01-24T01:33:51Z A computer-based approach in determining the chromatic number of a graph De la Rosa, Martin L. Gonzales, Eric P. 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. 1991-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15953 Bachelor's Theses English Animo Repository Computer programs Programming (Mathematics) Algorithms Graphic methods Graphs
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Computer programs
Programming (Mathematics)
Algorithms
Graphic methods
Graphs
spellingShingle Computer programs
Programming (Mathematics)
Algorithms
Graphic methods
Graphs
De la Rosa, Martin L.
Gonzales, Eric P.
A computer-based approach in determining the chromatic number of a graph
description 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.
format text
author De la Rosa, Martin L.
Gonzales, Eric P.
author_facet De la Rosa, Martin L.
Gonzales, Eric P.
author_sort De la Rosa, Martin L.
title A computer-based approach in determining the chromatic number of a graph
title_short A computer-based approach in determining the chromatic number of a graph
title_full A computer-based approach in determining the chromatic number of a graph
title_fullStr A computer-based approach in determining the chromatic number of a graph
title_full_unstemmed A computer-based approach in determining the chromatic number of a graph
title_sort computer-based approach in determining the chromatic number of a graph
publisher Animo Repository
publishDate 1991
url https://animorepository.dlsu.edu.ph/etd_bachelors/15953
_version_ 1772834978469511168