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: | 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 |
Similar Items
-
Graph isomorphism detection program
by: Torres, Emmanuel Ronald
Published: (1993) -
The b-chromatic number of power graphs of paths and cycles
by: San Diego, Immanuel T.
Published: (2005) -
On labelling harmonious graphs
by: Fabros, Roland R., et al.
Published: (1998) -
A computer based approach in determining the Hamiltonian cycle of a graph
by: Dimapilis, Anna Carina V., et al.
Published: (1993) -
Minimum 2-clique and 3-clique partitions of simple connected graphs
by: Alto, Washington Lee
Published: (1992)