Minimum 2-clique and 3-clique partitions of simple connected graphs
The researcher presents a computer-based procedure in determining the minimum number of 2-cliques and 3-cliques that can partition any given simple, connected graph G with degrees not exceeding four and with order n where 2 is less than or equal to n less than or equal to 12.
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1992
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15965 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | The researcher presents a computer-based procedure in determining the minimum number of 2-cliques and 3-cliques that can partition any given simple, connected graph G with degrees not exceeding four and with order n where 2 is less than or equal to n less than or equal to 12. |
|---|