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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16478 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-164782021-11-13T03:54:02Z Minimum 2-clique and 3-clique partitions of simple connected graphs Alto, Washington Lee 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. 1992-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15965 Bachelor's Theses English Animo Repository Graph theory Algorithms Programming (Mathematics) |
| 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 |
Graph theory Algorithms Programming (Mathematics) |
| spellingShingle |
Graph theory Algorithms Programming (Mathematics) Alto, Washington Lee Minimum 2-clique and 3-clique partitions of simple connected graphs |
| description |
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. |
| format |
text |
| author |
Alto, Washington Lee |
| author_facet |
Alto, Washington Lee |
| author_sort |
Alto, Washington Lee |
| title |
Minimum 2-clique and 3-clique partitions of simple connected graphs |
| title_short |
Minimum 2-clique and 3-clique partitions of simple connected graphs |
| title_full |
Minimum 2-clique and 3-clique partitions of simple connected graphs |
| title_fullStr |
Minimum 2-clique and 3-clique partitions of simple connected graphs |
| title_full_unstemmed |
Minimum 2-clique and 3-clique partitions of simple connected graphs |
| title_sort |
minimum 2-clique and 3-clique partitions of simple connected graphs |
| publisher |
Animo Repository |
| publishDate |
1992 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/15965 |
| _version_ |
1772834998202662912 |